#17367: Classes of combinatorial structures
-------------------------------------+-------------------------------------
Reporter: elixyre | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.5
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jean-Baptiste | Reviewers:
Priez | Work issues:
Report Upstream: N/A | Commit:
Branch: | 6771a334eac5460c5d193f58f28ea7fbc782189c
u/elixyre/class_of_combinatorial_structures| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by alauve):
Great ideas. (I prefer to keep "combinatorial' out of the name, if
possible.)
For the record, we're talking about **enumeratable** sets, right?
Set partitions, etc., may be enumeratable, but I don't want to specify an
enumeration (i.e., make it into an enumerated set) if I don't have to....
Or maybe I should?
(This would certainly be necessary if I planned to identify bases of
homogeneous graded slices of a Hopf algebra with QQ^n^ for some n, but
aside from that, I don't know that I'd want to specify an enumeration.)
--
Ticket URL: <http://trac.sagemath.org/ticket/17367#comment:13>
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.
