#16234: Assorted fixes optimizations in sage-combinat (mostly partitions and
tableaux)
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: combinat, | Merged in:
tableaux, partitions, findstat, | Reviewers:
documentation, integer_list, | Work issues:
mutability | Commit:
Authors: Darij Grinberg | 045ada00385e37ac746b7320388d13c2e0d9d5a2
Report Upstream: N/A | Stopgaps:
Branch: public/combinat |
/tableaux-et-al-doc |
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by darij):
* keywords: combinat, tableaux, partitions, findstat, documentation =>
combinat, tableaux, partitions, findstat, documentation, integer_list,
mutability
* cc: nthiery (added)
Old description:
> - Improve documentation of promotion operators (there are three of them
> in Sage) on SSYTs.
>
> - Add doc to Lascoux-Schützenberger action on tableaux.
>
> - Add a few more @combinatorial_map decorators on tableaux, partitions,
> posets.
>
> - Fix doc of the Greene-Kleitman partition method on finite posets.
>
> - Speed up `is_column_strict` and three further methods on tableaux. PSA:
> don't use `copy.deepcopy` unless you really don't know the internal
> structure of the objects you are copying.
New description:
- Improve documentation of promotion operators (there are three of them in
Sage) on SSYTs.
- Add doc to Lascoux-Schützenberger action on tableaux.
- Add a few more @combinatorial_map decorators on tableaux, partitions,
posets.
- Fix doc of the Greene-Kleitman partition method on finite posets.
- Speed up `is_column_strict` and three further methods on tableaux. PSA:
don't use `copy.deepcopy` unless you really don't know the internal
structure of the objects you are copying.
- Fix a bug in the iterator of `Partitions(..., outer=a)` that caused `a`
to be mutated occasionally, and that required `a` to be a list (as opposed
to, more reasonably, a partition or tuple):
{{{
sage: a = [4,2,1,1,1,1,1]
sage: for p in Partitions(8, outer=a, min_slope=-1):
print p
....:
[3, 2, 1, 1, 1]
[2, 2, 1, 1, 1, 1]
[2, 1, 1, 1, 1, 1, 1]
sage: a
[3, 2, 1, 1, 1, 1, 1]
}}}
--
--
Ticket URL: <http://trac.sagemath.org/ticket/16234#comment:8>
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.
