#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 elixyre):

 * cc: kcrisman, ncohen (removed)
 * cc: zabrocki (added)
 * status:  new => needs_review


Comment:

 Ok... this is not really a duplicate... #16465 contains lot of things...
 to many... I'm not sure about its destiny! whatever...

 This ticket #17367 provides a category of combinatorial classes
 `sage.categories.classes_of_combinatorial_structures.py`.
 It contains some methods that I need to define a simple design of
 (combinatorial) Hopf algebras.

 For example, most of the time we define graded connected Hopf algebras
 indexed by a "connected" class of combinatorial structure `C`. This means
 the unit and the counit MUST be automatically defined by the unique
 element of the graded component of degree 0 of `C` (As an user, I don't
 want write again and again this same code).

 - Problem: In sage, there is no way to ask `C.graded_component(n)`.

 This ticket provides to that, it provides those kind of methods. It also
 provides some code to easily design a class of combinatorial structures
 (`sage.combinat.structures.__init__.py`)

 new files:

  - `sage.categories.classes_of_combinatorial_structures.py` (the category)
  - `sage.categories.examples.classes_of_combinatorial_structures.py` (an
 example)
  - `sage.combinat.structures.__init__.py` (the design used in the example)

 all classes of combinatorial structures modified to use the category:

  - `sage.combinat.composition.py`
  - `sage.combinat.permutation.py`
  - `sage.combinat.binary_trees.py`

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