#7301: Gale Ryser theorem
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.1
Component: combinatorics | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
-----------------------------+----------------------------------------------
Comment(by wdj):
Just an update: My colleague agrees that my implementation is corect.
There was a issue because I told him that in my opinion the
algorithm (due to Ryser) as stated in the literature was imcomplete.
(A loop was missing in the pseudocode.) He also said he proved that my
version of the implementation was correct, though he did not write
anything down. He also said he had some suggestions for me but did not say
what they were.
Now he is grading finals but when he finishes, and I finish with my
grading, I'll be able to add the two Gale-Ryser implementations together.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7301#comment:22>
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.
