Abstract
Let \(\varvec{\mathcal {A}(n,k)}\) represent the collection of all \(\varvec{n\times n}\) zero-and-one matrices, with the sum of all rows and columns equalling \(\varvec{k}\). This set can be ordered by an extension of the classical Bruhat order for permutations, seen as permutation matrices. The Bruhat order on \(\varvec{\mathcal {A}(n,k)}\) differs from the Bruhat order on permutations matrices not being, in general, graded, which results in some intriguing issues. In this paper, we focus on the maximum length of antichains in \(\varvec{\mathcal {A}(n,k)}\) with the Bruhat order. The crucial fact that allows us to obtain our main results is that two distinct matrices in \(\varvec{\mathcal {A}(n,k)}\) with an identical number of inversions cannot be compared using the Bruhat order. We construct sets of matrices in \(\varvec{\mathcal {A}(n,k)}\) so that each set consists of matrices with the same number of inversions. These sets are hence antichains in \(\varvec{\mathcal {A}(n,k)}\). We use these sets to deduce lower bounds for the maximum length of antichains in these partially ordered sets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability Statement
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Brualdi, R.A.: Matrices of zeros and ones with fixed row and column sum vectors. Linear Algebra Appl. 33, 159–231 (1980)
Brualdi, R.A.: Short proofs of the Gale & Ryser and Ford & Fulkerson characterizations of the row and column sum vectors of \((0, 1)\)-matrices. Math. Inequal. Appl. 4, 157–159 (2001)
Brualdi, R.A.: Combinatorial matrix classes. Encyclopedia of Mathematics and its Applications, vol. 108. Cambridge University Press, Cambridge (2006)
Brualdi, R.A., Deaett, L.: More on the Bruhat order for (0, 1)-matrices. Linear Algebra Appl. 421(2–3), 219–232 (2007)
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 (2005)
Brualdi, R.A., Fernandes, R., Furtado, S.: On the Bruhat order of labeled graphs. Discrete Appl. Math 258, 49–64 (2018)
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)
Conflitti, A., da Fonseca, C.M., Mamede, R.: On the largest size of an antichain in the Bruhat order for A(2k, k). Order 30(1), 255–260 (2013)
da Cruz, H.F., Fernandes, R., Furtado, S.: Minimal matrices in the Bruhat order for symmetric (0,1)-matrices. Linear Algebra Appl. 530, 160–184 (2017)
Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)
Fernandes, R., da Cruz, H.F., Salomão, D.: On a conjecture concerning the Bruhat order. Linear Algebra Appl. 600, 82–95 (2020)
Fulkerson, D.R.: Zero-one matrices with zero trace. Pac. J. Math. 10, 831–836 (1960)
Gale, D.: A theorem on flows in networks. Pac. J. Math. 7, 1073–1082 (1957)
Ghebleh, M.: On maximum chains in the Bruhat order of \(\cal{A} (n, 2)\). Linear Algebra Appl. 446, 377–387 (2014)
Ghebleh, M.: Antichains of (0, 1)-matrices through inversions. Linear Algebra Appl. 458, 503–511 (2014)
Haber, R.M.: Term rank of (0, l)-matrices. Rend. Sem. Mat. Univ. Padova 30, 24–51 (1960)
Mirsky, L.: A dual of Dilworth’s decomposition theorem. Am. Math. Mon. 78, 876–877 (1971)
Pérez-Salvador, B.R., De-los-Cobos-Silva, S., Gutiéérrez-Ándrade, M.A., Torres-Chazaro, A.: A reduced formula for the precise number of (0,1)-matrices in \(\cal{A} (R, S)\). Discrete Math. 256, 361–372 (2002)
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9, 371–377 (1957)
Wang, B., Zhang, F.: On the precise number of \((0, 1)\)-matrices in \(\cal{U} (R, S)\). Discrete Math. 187, 211–220 (1998)
Wei, Wan-Di.: The class \(\cal{A} (R, S)\) of \((0,1)\)-matrices. Discrete Math. 39, 301–305 (1982)
Funding
Open access funding provided by FCT|FCCN (b-on). Open access funding provided by FCT|FCCN (b-on). This work was supported by FCT- Fundação para a Ciência e Tecnologia, under project UIDB/00212/2020.
Author information
Authors and Affiliations
Contributions
The author conceived the original idea, performed the computation and write the manuscript.
Corresponding author
Ethics declarations
Conflict of Interests
The author does not have any conflict of interest to declare.
Competing Interests
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
da Cruz, H.F. Antichains in the Bruhat Order for the Classes \(\mathcal {A}(n,k)\). Order (2023). https://doi.org/10.1007/s11083-023-09654-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11083-023-09654-6