Hi Nicolas and Mike,
Nicolas, thank you very much for your comments! I will implement them. But
there is one
question (and the reason why I wanted you to look at this code):
- Cores: use the category FiniteEnumeratedSets(). Since list is
implemented, this should be sufficient.
As implemented right now, Cores is the set of all cores and hence not
a finite set. That's why I specified the category only as Sets() rather
than FiniteEnumeratedSets(). As you might notice, list takes an extra
argument, namely n, which then lists all Cores of size n.
If we followed the design of the Partition class, we would have
def Cores
which takes optional arguments and delegates to the right class.
class Cores_n would be the set of cores of size n.
However, mathematically speaking, I am not sure whether the size of the cores
is the right thing to look at. Perhaps it should be rather the number of boxes
in the corresponding k-bounded partition or length of the corresponding affine
Grassmannian. That's the reason I did it as it is right now.
Best,
Anne
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
