On the Largest Size of an Antichain in the Bruhat Order for
Open Access
- 7 December 2011
- journal article
- research article
- Published by Springer Nature in Order
- Vol. 30 (1) , 255-260
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The maximal length of a chain in the Bruhat order for a class of binary matricesLinear Algebra and its Applications, 2012
- On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entriesAdvances in Mathematics, 2010
- Constructing integral matrices with given line sumsLinear Algebra and its Applications, 2009
- On (0, 1)-matrices with prescribed row and column sum vectorsDiscrete Mathematics, 2009
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sumsAdvances in Applied Mathematics, 2008
- More on the Bruhat order for (0,1)-matricesLinear Algebra and its Applications, 2007
- Algorithms for constructing -matrices with prescribed row and column sum vectorsDiscrete Mathematics, 2006
- Combinatorial Matrix Classes2006
- Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sumsJournal of Combinatorial Theory, Series A, 2006
- A theorem on flows in networksPacific Journal of Mathematics, 1957