Skip to main content
SpringerLink
Log in

On the Largest Size of an Antichain in the Bruhat Order for

  • Published:
Order Aims and scope Submit manuscript

Abstract

We discuss a problem proposed by Brualdi and Deaett on the largest size of an antichain in the Bruhat order for the interesting combinatorial class of binary matrices of .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barvinok, A.: On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries. Adv. Math. 224(1), 316–339 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brualdi, R.A.: Combinatorial Matrix Classes, Encyclopedia of Mathematics and its Applications, vol. 108. Cambridge University Press, Cambridge (2006)

    Book  Google Scholar 

  3. Brualdi, R.A.: Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors. Discrete Math. 306(3), 3054–3062 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brualdi, R.A., Deaett, L.: More on the Bruhat order for (0, 1)-matrices. Linear Algebra Appl. 421(2–3), 219–232 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brualdi, R.A., Hwang, S.-G.: A Bruhat order for the class of (0, 1)-matrices with row sum vector R and column sum vector S. Electron. J. Linear Algebra 12, 6–16 (2004/2005)

    MathSciNet  Google Scholar 

  6. Canfield, E.R., McKay, B.D.: Asymptotic enumeration of dense 0–1 matrices with equal row sums and equal column sums. Electron. J. Combin. 12, Research Paper 29 (2005)

    Google Scholar 

  7. Conflitti, A., da Fonseca, C.M., Mamede, R.: The maximal length of a chain in the Bruhat order for a class of binary matrices. Linear Algebra Appl. 436(3), 753–757 (2012). Available online at doi:10.1016/j.laa.2011.07.043

    Article  MathSciNet  MATH  Google Scholar 

  8. Dias da Silva, J.A., Fonseca, A.: Constructing integral matrices with given line sums. Linear Algebra Appl. 431(9), 1553–1563 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. da Fonseca, C.M., Mamede, R.: On (0, 1)-matrices with prescribed row and column sum vectors. Discrete Math. 309(8), 2519–2527 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gale, D.: A theorem on flows in networks. Pac. J. Math. 7, 1073–1082 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  11. Greenhill, C., McKay, B.D.: Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. 41(4), 459–481 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Greenhill, C., McKay, B.D., Wang, X.: Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory Ser. A 113(2), 291–324 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Goldstein, D., Stong, R.: On the number of possible row and column sums of 0, 1-matrices. Electron. J. Comb. 13(1), Note 8 (2006)

    Google Scholar 

  14. McKay, B.D., Wang, X.: Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums. Linear Algebra Appl. 373, 273–287 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pérez-Salvador, B.R., de-los-Cobos-Silva, S., Gutiérrez-Andrade, M.A., Torres-Chazaro, A.: A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal{A}}({\bf R},{\bf S})\). Discrete Math. 256(1–2), 361–372 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371–377 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ryser, H.J.: Combinatorial Mathematics, The Carus Mathematical Monographs, no. 14. Wiley, New York (1963)

    Google Scholar 

  18. Wang, B.-Y.: Precise number of (0, 1)-matrices in \(\mathfrak{A}(R,S)\). Sci. Sin. Ser. A 31(1), 1–6 (1988)

    MATH  Google Scholar 

  19. Wang, B.-Y., Zhang, F.: On the precise number of (0, 1)-matrices in \(\mathfrak{A}(R,S)\). Discrete Math. 187(1–3), 211–220 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CMUC, Centre for Mathematics, University of Coimbra, Apartado 3008, 3001–454, Coimbra, Portugal

    Alessandro Conflitti

  2. Department of Mathematics, University of Coimbra, 3001–454, Coimbra, Portugal

    C. M. da Fonseca & Ricardo Mamede

Authors
  1. Alessandro Conflitti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. M. da Fonseca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ricardo Mamede
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alessandro Conflitti.

Additional information

This work is supported by CMUC - Centro de Matemática da Universidade de Coimbra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conflitti, A., da Fonseca, C.M. & Mamede, R. On the Largest Size of an Antichain in the Bruhat Order for . Order 30, 255–260 (2013). https://doi.org/10.1007/s11083-011-9241-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-011-9241-1

Keywords

Mathematics Subject Classification (2010)

Search

Navigation