#19055: Tableau hash depends on subclass
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: tableaux, hashing | Merged in:
Authors: Darij Grinberg | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/tableau_hash | 27788705a3241374377904895b341c9c504605df
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by darij):
I like your idea, Nicolas; but I'd like to have this structure reflected
in code somewhere. Something along the lines of: Every array-like class
`C` has a pointer to the largest array-like class `D` such that `C` is
transparent over `D` (meaning `x == D(x)` for every instance `x` of `C`).
For tableaux of various sorts, this would be `Tableau`; for Gelfand-
Tsetlin patterns it would probably be `GelfandTsetlinPattern` or something
like this, unless `GelfandTsetlinPattern` itself is a subclass of
`Tableau`, in which case we would have to introduce a proper subclass for
actual tableaux to get the Gelfand-Tsetlin patterns out. (Sorry, I don't
have Sage open right now, and I don't remember the hierarchy.)
--
Ticket URL: <http://trac.sagemath.org/ticket/19055#comment:8>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
