Antichains in the Bruhat order for the classes A(n,k)

DOI10.1007/S11083-023-09654-6MaRDI QIDQ6663922zbMATH OpenFDO

Authors Henrique F.da Cruz

Publication date 15 January 2025

Published in Order (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11083-023-09654-6

zbMATH Keywords

(0, 1)-matricesantichainsBruhat orderinversions

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites work

• A decomposition theorem for partially ordered sets
• A Dual of Dilworth's Decomposition Theorem
• A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
• A theorem on flows in networks
• Antichains of \((0, 1)\)-matrices through inversions
• Combinatorial matrix classes
• Combinatorial Properties of Matrices of Zeros and Ones
• scientific article; zbMATH DE number 2144320 (Why is no real title available?)
• Matrices of zeros and ones with fixed row and column sum vectors
• Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
• More on the Bruhat order for (0, 1)-matrices
• On a conjecture concerning the Bruhat order
• On maximum chains in the Bruhat order of A(n,2)
• On the Bruhat order of labeled graphs
• On the largest size of an antichain in the Bruhat order for A (2k,k)
• On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
• Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices
• Term rank of 0,1 matrices
• The class A(R,S) of (0,1)-matrices
• The maximal length of a chain in the Bruhat order for a class of binary matrices
• Zero-one matrices with zero trace

This page was built for publication: Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663922)