#7301: Gale Ryser theorem
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: combinatorics | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
-----------------------------+----------------------------------------------
Comment(by wdj):
Nathann:
I have started reading these books and spoken to my colleague again. The
book
{{{
Combinatorial Mathematics
By Ryser (has a chapter on A(R,S))
}}}
has a construction (due to Ryser) which is in many cases more valuable
than the construction implemented (due to Gale). Moreover, the
implementation of the construction assumes that the R,S have no
trailing 0's. It seems natural to assume that the user can simply remove
any trailing 0's in the input sequence (I thought so myself). However, my
colleague assures me that if you could implement the exact same function
but allow for trailing 0's then the function would be more useful.
I need to digest the Ryser algorithm better but thought I would post this
update FYI.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7301#comment:15>
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.
