Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices
From MaRDI portal
Publication:4554532
DOI10.1007/978-3-319-49984-0_15zbMath1400.15033OpenAlexW2592640171MaRDI QIDQ4554532
Publication date: 14 November 2018
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49984-0_15
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- A theorem on flows in networks
- Zero-one matrices with zero trace
- Term rank of \(0,1\) matrices
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- More on the Bruhat order for (0, 1)-matrices
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Matrices of zeros and ones with fixed row and column sum vectors
- Coxeter matroids. With illustrations by Anna Borovik
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- The lattice of integer partitions
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Antichains of \((0, 1)\)-matrices through inversions
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- On the number of possible row and column sums of \(0,1\)-matrices
- The asymptotic number of integer stochastic matrices
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- A decomposition theorem for partially ordered sets
- Short Proofs of the Gale & Ryser and Ford & Fulkerson Characterizations of the Row and Column Sum Vectors of (0,1)-Matrices
- Combinatorial Properties of Matrices of Zeros and Ones
- A Simple Proof of the Gale-Ryser Theorem
- Asymptotics and random matrices with row-sum and column sum-restrictions
- A Dual of Dilworth's Decomposition Theorem
This page was built for publication: Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices
