On (0, 1)-matrices with prescribed row and column sum vectors

DOI10.1016/j.disc.2008.06.013zbMath1197.05160OpenAlexW2167726696MaRDI QIDQ1025513

Ricardo Mamede, Carlos Martins de Fonseca

Publication date: 19 June 2009

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

Full work available at URL: http://hdl.handle.net/10316/11281

zbMATH Keywords

partitionsYoung tableauxmajorizationRobinson-Schensted-Knuth algorithm(01)-matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Symmetric functions and generalizations (05E05)

Related Items (5)

An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors ⋮ On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) ⋮ The maximal length of a chain in the Bruhat order for a class of binary matrices ⋮ A catalog of self-affine hierarchical entropy functions ⋮ Majorization and the number of bipartite graphs for given vertex degrees

Cites Work

• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Algorithms for constructing \((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
• Permutations, matrices, and generalized Young tableaux
• Combinatorial Properties of Matrices of Zeros and Ones
• Longest Increasing and Decreasing Subsequences

This page was built for publication: On (0, 1)-matrices with prescribed row and column sum vectors