Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors

@article{Brualdi2006AlgorithmsFC,
  title={Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors},
  author={Richard A. Brualdi},
  journal={Discrete Mathematics},
  year={2006},
  volume={306},
  pages={3054-3062}
}
There is a bijection between the class A(R, S) of (0, 1)-matrices with row sum vector R and column sum vector S and pairs of Young tableaux of conjugate shapes and ∗ with S R∗. In this bijection, the tableau of shape , the insertion tableau, has content S and the tableau of shape ∗, the recording tableau, has content R. Using a Ryser-like algorithm, we give canonical constructions for matrices in A(R, S) whose insertion tableaux have shape = S and R∗, respectively. © 2006 Elsevier B.V. All… CONTINUE READING

From This Paper

Topics from this paper.
10 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Combinatorial Classes of Matrices

  • R. A. Brualdi
  • Encyclopedia of Mathematics and its Applications…
  • 2006
Highly Influential
4 Excerpts

Young tableaux

  • W. Fulton
  • London Mathematical Society Student Texts, vol…
  • 1997
3 Excerpts

Matrices of zeros and ones with fixed row and column sum vectors

  • R. A. Brualdi
  • Linear Algebra Appl. 33
  • 1980
2 Excerpts

An extension of Schensted’s theorem

  • C. Greene
  • Adv. Math. 14
  • 1974
1 Excerpt

Permutation matrices and generalized Young tableaux

  • D. E. Knuth
  • Pacific J. Math. 34
  • 1970
1 Excerpt

Similar Papers

Loading similar papers…