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_15zbMATH Open1400.15033OpenAlexW2592640171MaRDI QIDQ4554532FDOQ4554532
Authors: Ricardo Mamede 
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
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 \(\mathcal 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
- Combinatorial matrix classes
- A course in combinatorics.
- A theorem on flows in networks
- Title not available (Why is that?)
- A Dual of Dilworth's Decomposition Theorem
- The lattice of integer partitions
- Matrices of zeros and ones with fixed row and column sum vectors
- Combinatorial Properties of Matrices of Zeros and Ones
- A decomposition theorem for partially ordered sets
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Title not available (Why is that?)
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- More on the Bruhat order for (0, 1)-matrices
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Title not available (Why is that?)
- Zero-one matrices with zero trace
- Coxeter matroids. With illustrations by Anna Borovik
- Term rank of \(0,1\) matrices
- On the number of possible row and column sums of \(0,1\)-matrices
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- Asymptotics and random matrices with row-sum and column sum-restrictions
- A Simple Proof of the Gale-Ryser Theorem
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- The asymptotic number of integer stochastic matrices
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Antichains of \((0, 1)\)-matrices through inversions
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- Closed formulas and integer sequences arising from the enumeration of \((0,1)\)-matrices with row sum two and some constant column sums
- Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices
Cited In (11)
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Antichains of \((0, 1)\)-matrices through inversions
- Ordering classes of matrices of 0's and 1's
- Bruhat order of tournaments
- A certain Bruhat order on doubly substochastic matrices
- On a conjecture concerning the Bruhat order
- Title not available (Why is that?)
- 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)
