#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):
Replying to [comment:12 ncohen]:
> Hello everybody !!!
...
>
> Besides, your friend was talking about "different subsets of numbers".
Well,
> I only met this problem for 0-1 matrices and I assume your are not
talking about
> replacing 0 by x and 1 by y... Do you mean that there is a version of
this theorem
> working simultaneously for several types of different variables (with
two partitions
> per type of variable, etc...) ?? This would interest me very much !!
>
Yes, he indicated that a very simple modification of the construction
should
allow one to construct matrices whose entries are in (say) {0,1, ...,
m-1},
with give column sums and given row sums if one exists. (Here m > 1 is
a user-supplied integer which is m=2 in your current implementation.)
> Thank you for your interest !
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7301#comment:14>
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.
