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

DOI10.1016/J.DISC.2004.10.028zbMATH Open1110.05102OpenAlexW1995751254MaRDI QIDQ856850FDOQ856850

Authors: Richard A. Brualdi 

Publication date: 14 December 2006

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

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

Recommendations

• On (0, 1)-matrices with prescribed row and column sum vectors
• An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors
• Schröder partitions and Schröder tableaux
• Permutations, matrices, and generalized Young tableaux
• Finding the permutations corresponding to a given Young tableau
• Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
• The computer-aided discovery of a theorem about Young tableaux
• scientific article; zbMATH DE number 6473264
• Ascending subsequences of permutations and the shapes of tableaux
• Insertion and the multiplication of rational Schur functions

zbMATH Keywords

algorithmsYoung tableauxKostka numbersGale-Ryser theoremKnuth-Schensted correspondencerow and columns sum vectorsRyser algorithm

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Cites Work

• Combinatorial matrix classes
• Permutations, matrices, and generalized Young tableaux
• Title not available (Why is that?)
• Matrices of zeros and ones with fixed row and column sum vectors
• An extension of Schensted's theorem

Cited In (22)

• 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)\)
• Title not available (Why is that?)
• Antichains of \((0, 1)\)-matrices through inversions
• On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
• On (0, 1)-matrices with prescribed row and column sum vectors
• New linearizations of quadratic assignment problems
• A catalog of self-affine hierarchical entropy functions
• Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
• An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors
• A note on majorization transforms and Ryser's algorithm
• Title not available (Why is that?)
• Binary image reconstruction based on prescribed numerical information
• Algorithm for constructing matrices of zeros and ones with prescribed row and column sums
• Matrices of zeros and ones with given line sums and a zero block
• Permutations, matrices, and generalized Young tableaux
• Majorization and the number of bipartite graphs for given vertex degrees
• New summary measures and datasets for the multi-project scheduling problem
• SPC product codes, graphs with cycles and Kostka numbers
• Decomposable Pauli diagonal maps and tensor squares of qubit maps
• The Kostka semigroup and its Hilbert basis
• The maximal length of a chain in the Bruhat order for a class of binary matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856850)