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