An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors

DOI10.1016/j.disc.2013.06.016zbMath1281.05129OpenAlexW2037775637MaRDI QIDQ393474

Rosário Fernandes, Henrique F. da Cruz

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.06.016

zbMATH Keywords

Young tableaux\((0,1)\)-matricesRSK algorithmrow and column vectors

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items (2)

Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks ⋮ Majorization and the number of bipartite graphs for given vertex degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• On (0, 1)-matrices with prescribed row and column sum vectors
• Matrices of zeros and ones with fixed row and column sum vectors
• An extension of Schensted's theorem
• Longest Increasing and Decreasing Subsequences

This page was built for publication: An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors