#13243: new methods for compositions
------------------------------------------------------------------------------+
       Reporter:  saliola                                                     | 
        Owner:  sage-combinat
           Type:  enhancement                                                 | 
       Status:  needs_review 
       Priority:  major                                                       | 
    Milestone:  sage-5.3     
      Component:  combinatorics                                               | 
   Resolution:               
       Keywords:  compositions, ncsf, sd40                                    | 
  Work issues:               
Report Upstream:  N/A                                                         | 
    Reviewers:  Chris Berg   
        Authors:  Franco Saliola, Nicolas Thiery, Florent Hivert, Chris Berg  | 
    Merged in:               
   Dependencies:                                                              | 
     Stopgaps:               
------------------------------------------------------------------------------+
Changes (by saliola):

  * status:  needs_work => needs_review


Old description:

> new functionality for the composition constructor:
>
> - construct a composition from a subset
>

> new functionality for compositions:
>
> - parent -- returns Compositions()
> - reversed - reverses
> - refinement_splitting
> - refinement_splitting_lengths(self, J):
> - partial_sums(self, final=True):
> - to_subset(self, final=False):
> - to_partition(self):
> - shuffle_product(self, other, overlap=False):
>

> new functionality for the set of all compositions:
>
> - put it in the category of {{{GradedEnumeratedSets}}}
> - subset method to extract subsets of composition (by size)

New description:

 new functionality for the composition constructor:

 - construct a composition from a subset


 new functionality for compositions:

 - parent -- returns Compositions()
 - reversed - reverses
 - refinement_splitting
 - refinement_splitting_lengths(self, J):
 - partial_sums(self, final=True):
 - to_subset(self, final=False):
 - to_partition(self):
 - shuffle_product(self, other, overlap=False):


 new functionality for the set of all compositions:

 - put it in the category of {{{InfiniteEnumeratedSets}}}
 - subset method to extract subsets of composition (by size)

--

Comment:

 The errors were mainly due to the fact that the new category of ''graded''
 enumerated sets does not yet exist (it exists on the sage-combinat queue,
 which is why tests passed on my machine). So I removed the two lines
 related to that.

 I also modified a couple of doctests in {{{permutation.py}}}, which was
 caused by the change  the descents method.

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13243#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to