Chains and antichains in the Bruhat order for classes of (0,1)-matrices
From MaRDI portal
Publication:4554532
Recommendations
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- On maximum chains in the Bruhat order of A(n,2)
- scientific article; zbMATH DE number 2144320
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- More on the Bruhat order for (0, 1)-matrices
Cites work
- scientific article; zbMATH DE number 4112600 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 2144320 (Why is no real title available?)
- A Dual of Dilworth's Decomposition Theorem
- A Simple Proof of the Gale-Ryser Theorem
- A course in combinatorics.
- A decomposition theorem for partially ordered sets
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- A theorem on flows in networks
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- Antichains of \((0, 1)\)-matrices through inversions
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Asymptotics and random matrices with row-sum and column sum-restrictions
- Closed formulas and integer sequences arising from the enumeration of \((0,1)\)-matrices with row sum two and some constant column sums
- Combinatorial Properties of Matrices of Zeros and Ones
- Combinatorial matrix classes
- Coxeter matroids. With illustrations by Anna Borovik
- Matrices of zeros and ones with fixed row and column sum vectors
- More on the Bruhat order for (0, 1)-matrices
- On maximum chains in the Bruhat order of A(n,2)
- On the largest size of an antichain in the Bruhat order for A (2k,k)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- On the number of possible row and column sums of 0,1-matrices
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices
- Term rank of 0,1 matrices
- The asymptotic number of integer stochastic matrices
- The lattice of integer partitions
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- Zero-one matrices with zero trace
Cited in
(11)- On the largest size of an antichain in the Bruhat order for A (2k,k)
- Antichains of \((0, 1)\)-matrices through inversions
- Ordering classes of matrices of 0's and 1's
- Bruhat order of tournaments
- On a conjecture concerning the Bruhat order
- A certain Bruhat order on doubly substochastic matrices
- scientific article; zbMATH DE number 2144320 (Why is no real title available?)
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- On the Bruhat order of labeled graphs
- Doubly stochastic matrices and the Bruhat order.
This page was built for publication: Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554532)
