#17367: Classes of combinatorial structures
-------------------------------------+-------------------------------------
Reporter: elixyre | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jean-Baptiste | Reviewers:
Priez | Work issues:
Report Upstream: N/A | Commit:
Branch: | c13301a1fe97f639089a691bd0f75d78cc8aa6a0
u/elixyre/class_of_combinatorial_structures| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by zabrocki):
If same thing can be achieved by adding to `SetsWithGrading`, that would
be great, but I imagine that some thought will have to go into the
applications of this category to make sure they can still be as simple
(since one goal is to make it easy to define a combinatorial Hopf algebra,
+others).
I didn't know the word `denumerable` either but in my dictionary it says
"adjective - Mathematics - able to be counted by a one-to-one
correspondence with the infinite set of integers" so I figure that is
about right.
Jean-Baptiste and I had a discussion about the use of `structure` and he
was taking it from the use in species and from `sage.misc.structure`. I
agree that it seems a bit too vague a word which prompted the switch to
`ElementStructure` and `ParentStructure`. Maybe this requires further
thought.
--
Ticket URL: <http://trac.sagemath.org/ticket/17367#comment:18>
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.
