Antichains of \((0, 1)\)-matrices through inversions

DOI10.1016/j.laa.2014.06.021zbMath1296.05037MaRDI QIDQ2250943

Mohammad Ghebleh

Publication date: 22 July 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.06.021

zbMATH Keywords

antichain; inversion; chain; Bruhat order; \((0,1)\)-matrix

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

06A07: Combinatorics of partially ordered sets

15B36: Matrices of integers

Related Items

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Unnamed Item, Extremal matrices for the Bruhat-graph order, The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\), Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide, On the Bruhat order of labeled graphs, Minimal matrices in the Bruhat order for symmetric (0,1)-matrices, On a conjecture concerning the Bruhat order, The Bruhat order on classes of isotopic Latin squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximal length of a chain in the Bruhat order for a class of binary matrices
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• More on the Bruhat order for (0, 1)-matrices
• Matrices of zeros and ones with fixed row and column sum vectors
• On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
• On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
• The asymptotic number of integer stochastic matrices
• A decomposition theorem for partially ordered sets
• A Dual of Dilworth's Decomposition Theorem