#15143: Improvements to SetPartitions
------------------------------------+-----------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.12
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Travis Scrimshaw | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
------------------------------------+-----------------------------
Comment (by darij):
Oops, I didn't realize {{{__mul__}}} was there before you. Anyway, I'll
take a look at it if you don't; it sounds like a cheap speedup one can get
from just throwing away old code.
The Bergeron-Zabrocki paper you linked me to (thank you!) says "A is
called atomic if it is non-empty and not splittable"; note the "non-empty"
here. But apparently some other sources don't require non-emptiness. As
far as I am concerned, the "non-empty" convention makes more sense; these
are supposed to be a free monoid generating set of the monoid of all set
partitions, so there is no reason the unity of the monoid should be there.
--
Ticket URL: <http://trac.sagemath.org/ticket/15143#comment:4>
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/groups/opt_out.
