On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)

DOI10.1007/s11083-011-9241-1zbMath1260.05024OpenAlexW1987495414WikidataQ60692017 ScholiaQ60692017MaRDI QIDQ1943693

Alessandro Conflitti, Ricardo Mamede, Carlos Martins de Fonseca

Publication date: 20 March 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-011-9241-1

zbMATH Keywords

Bruhat orderantichainsrow and column sum vectors(0, 1)-matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07) Matrices of integers (15B36)

Related Items (8)

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ The Bruhat rank of a binary symmetric staircase pattern ⋮ Unnamed Item ⋮ The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\) ⋮ The Bruhat order on classes of isotopic Latin squares ⋮ Bruhat order of tournaments ⋮ Antichains of \((0, 1)\)-matrices through inversions ⋮ Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide

Cites Work

• Unnamed Item
• The maximal length of a chain in the Bruhat order for a class of binary matrices
• A theorem on flows in networks
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Constructing integral matrices with given line sums
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• More on the Bruhat order for (0, 1)-matrices
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• On (0, 1)-matrices with prescribed row and column sum vectors
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• 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)
• On the number of possible row and column sums of \(0,1\)-matrices
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Combinatorial Properties of Matrices of Zeros and Ones

This page was built for publication: On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)