#7301: Gale Ryser theorem
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: combinatorics | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
-----------------------------+----------------------------------------------
Comment(by wdj):
Replying to [comment:19 ncohen]:
> Excellent !!! Well, could you send your code as a patch to replace mine
> then, as it does not use LP ? :-)
>
I will submit my code to my colleague, who does not use Sage
or know how to program (as far as I know) but can read Python:-)
He already said that you have implemented Gale's algorithm, and
I have implemented Ryser. He does not agree that your implementation
should be replaced by mine. Perhaps we make my implementation
the default since it seems "more elementary" than yours?
More later when I receive his report.
> two remarks though :
>
> * Perhaps "slider" could be defined inside the gale_ryser function,
> except if it can be useful in other parts of Sage
> * The order defined on the partitions is equivalent to the the
> function "dominates" in the Partition class.. In my patch it was written
> as p2.conjugate().dominates(p1), so it may not be necessary to rewrite
it
>
> Great work !! :-)
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7301#comment:20>
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.
