#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:                     |
-------------------------------------+-------------------------------------
Changes (by zabrocki):

 * cc: alauve (added)


Comment:

 I am talking with Jean-Baptiste so I want to make a few things clear in
 this ticket for the record.  My main question when I look at this
 category, is how is it different than `InfiniteEnumeratedSet`?   and his
 answer is that an infinite enumerated set is not necessarily graded while
 this is the main point of defining this category.

 Follow-up question is then is/should/could
 `ClassesOfCombinatorialStructure` be a sub-category of `GradedSet` and
 `InfiniteEnumeratedSet`?  He answers: it could be.

 Follow-up question is then a better name `InfiniteGradedSet`? Answer: why
 not?

 The reason graded infinite enumerated sets are ALL over combinat and we
 need common methods to work with them and create combinatorial Hopf
 algebras of a `ClassesOfCombinatorialStructure`.  Aaron Lauve was asking
 me precisely about this structure last time I spoke with him in person
 (hence I add him to the cc list).  The idea is to create category for
 defining any combinatorial class for which once the basics of the class
 are defined then one can make "the combinatorial Hopf algebra" of that
 class.

--
Ticket URL: <http://trac.sagemath.org/ticket/17367#comment:10>
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.

Reply via email to