Matrices of zeros and ones with fixed row and column sum vectors
From MaRDI portal
Publication:1146695
DOI10.1016/0024-3795(80)90105-6zbMATH Open0448.05047OpenAlexW2072502638WikidataQ56288392 ScholiaQ56288392MaRDI QIDQ1146695
Publication date: 1980
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(80)90105-6
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Matrices of integers (15B36) Graph theory (05C99) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- The Factorization of Linear Graphs
- A theorem on flows in networks
- Transversal theory. An account of some aspects of combinatorial mathematics
- The diagonal equivalence of a nonnegative matrix to a stochastic matrix
- Cyclic and diagonal products on a matrix
- Parallel concepts in graph theory
- Combinatorial Properties of Matrices of Zeros and Ones
- Permanents
- Widths and Heights of (0,1) -Matrices
- Multiplicities and Minimal Widths for (0, 1)-Matrices
- Width Sequences for Special Classes of (0, 1)-Matrices
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- A lower bound for permanents of (0,1)-matrices
- Non-singular 0-1 matrices with constant row and column sums
- Matrices of 0's and 1's with total support
- Zero-one matrices with zero trace
- A short proof of Minc's conjecture
- Distinct representatives of subsets
- Term rank of \(0,1\) matrices
- Matrices of zeros and ones
- On Lower Bounds for Permanents of (0, 1) Matrices
- On the Permanent of a Certain Class of (0, 1)-Matrices
- Combinatorial theorems and integral matrices
- Traces of Matrices of Zeros and Ones
- A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
- Convex Sets of Non-Negative Matrices
- A Lower Bound on the Permanent of a (0, 1)-Matrix
- An Upper Bound for the Permanent of a Fully Indecomposable Matrix
- A Lower Bound for the Permanent of a (0, 1)-Matrix
- Matrix factorizations of determinants and permanents
- Two combinatorial covering theorems
- Note on the Transfinite Case of Hall's Theorem on Representatives
- The Term Rank of a Matrix
- A general upper bound for 1-widths
- The 1-width of (0,1)-matrices having constant row sum 3
- Problems Involving Diagonal Products in Nonnegative Matrices
- On Ryser's maximum term rank formula
- Term ranks and permanents of nonnegative matrices
- Systems of distinct representatives. II
- On Haber's minimum term rank formula
- Invariant Sets for Classes of Matrices of Zeros and Ones
- Matrices permutation equivalent to irreducible matrices and applications
- (0,1)-matrices with minimal permanents
- A lower bound for the permanent on \(U_ n(k,k)\)
- Minimal Term Rank of a Class of (0, 1)-Matrices
- A Canonical Form For Fully Indecomposable (0,1)-Matrices
- Local Restrictions for Various Classes of Directed Graphs
- Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
- Existence theorem for infinite integral matrices
- MAXIMAL DEPTH OF A CLASS OF $ (0,1)$-MATRICES
Cited In (92)
- An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- Antichains of \((0, 1)\)-matrices through inversions
- On the eigenvalues of the structure matrix of matrices of zeros and ones
- Discrete tomography determination of bounded lattice sets from four X-rays
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- Extremal problems under dimension constraints.
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- Majorization permutahedra and (0,1)-matrices
- On (0, 1)-matrices with prescribed row and column sum vectors
- Addition of sets via symmetric polynomials - a polynomial method
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- On realization graphs of degree sequences
- Reconstruction of convex 2D discrete sets in polynomial time
- Matrices with prescribed row, column and block sums
- Title not available (Why is that?)
- An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors
- The structure matrix and a generalization of Ryser's maximum term rank formula
- Some properties for a class of interchange graphs
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
- The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
- A generalization of Ryser's theorem on term rank
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- A new look at the optimal assignment problem
- Latin Squares and their Bruhat Order
- Binary vectors partially determined by linear equation systems
- Prime interchange graphs of classes of matrices of zeros and ones
- Some properties of a class of interchange graphs
- On assignment functions
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- The relationship between the class \({\mathfrak A}_2(R,S)\) of (0, 1, 2)-matrices and the collection of constellation matrices
- Uniform sampling ofk-hypertournaments
- Small diameter interchange graphs of classes of matrices of zeros and ones
- Reconstruction of convex polyominoes from orthogonal projections of their contours
- On the upper bound of the diameter of interchange graphs
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Hamiltonicity of a type of interchange graphs
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Matrices of zeros and ones with the maximum jump number
- Matrices of zeros and ones with given line sums and a zero block
- The network flows approach for matrices with given row and column sums
- Defining Sets and Critical Sets in (0,1)‐Matrices
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Product action.
- Balanced home-away assignments
- On the minimum rank of regular classes of matrices of zeros and ones
- Singular (0,1) matrices with constant row and column sums
- On joint realization of (0,1) matrices
- Minimal matrices and discrete tomography
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- An introduction to periodical discrete sets from a tomographical perspective
- Joint realization of (0, 1) matrices revisited
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Triangular (0,1)-matrices with prescribed row and column sums
- More on the Bruhat order for (0, 1)-matrices
- Chromatic number of classes of matrices of zeros and ones
- Invariant sets of arcs in network flow problems
- Matrices of zeros and ones with given line sums and a zero block
- The structure matrix of (0,1)-matrices: Its rank, trace, and eigenvalues. An application to econometric models
- Constructing (0,1)-matrices with large minimal defining sets
- A sufficient condition for non-uniqueness in binary tomography with absorption
- Integral matrices with given row and column sums
- Approximating hv-Convex Binary Matrices and Images from Discrete Projections
- On normal matrices of zeros and ones with fixed row sum
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
- Sampling \(k\)-partite graphs with a given degree sequence
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
- Rejection sampling of bipartite graphs with given degree sequence
- A note on majorization transforms and Ryser's algorithm
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem
- Detecting arrays for effects of single factors
- A Legendre pair of length 77 using complementary binary matrices with fixed marginals
- Switches in Eulerian graphs
- Alternating signed bipartite graphs and difference-1 colourings
- On the properties of interchange operations in classes of \((0,1)\)- matrices
- Graphs and degree sequences. I
- On the enumeration of rectangular (0, 1)-matrices
- New summary measures and datasets for the multi-project scheduling problem
- Switching checkerboards in \((0,1)\)-matrices
- On the uniqueness of correspondence analysis solutions
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices
- On asymmetric \((0,1)\)-matrices with given row and column sum vectors
- The Kostka semigroup and its Hilbert basis
- On \(\mathfrak A(R,S)\) all of whose members are indecomposable
- Sampling contingency tables
- Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
- On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity
- Block-regularized repeated learning-testing for estimating generalization error
- Cliques in realization graphs
This page was built for publication: Matrices of zeros and ones with fixed row and column sum vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146695)
