The maximal length of a chain in the Bruhat order for a class of binary matrices
DOI10.1016/J.LAA.2011.07.043zbMATH Open1236.05046OpenAlexW2167697815WikidataQ60692258 ScholiaQ60692258MaRDI QIDQ649577FDOQ649577
Authors: Alessandro Conflitti, Ricardo Mamede, C. M.da Fonseca 
Publication date: 2 December 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.07.043
Recommendations
- Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- scientific article; zbMATH DE number 2144320
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- More on the Bruhat order for (0, 1)-matrices
Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Combinatorial matrix classes
- A theorem on flows in networks
- Matrices of zeros and ones with fixed row and column sum vectors
- Combinatorial Properties of Matrices of Zeros and Ones
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Title not available (Why is that?)
- Title not available (Why is that?)
- More on the Bruhat order for (0, 1)-matrices
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- On (0, 1)-matrices with prescribed row and column sum vectors
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- A Simple Proof of the Gale-Ryser Theorem
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Constructing integral matrices with given line sums
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Row and column orthogonal (0,1)-matrices
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
Cited In (16)
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Antichains of \((0, 1)\)-matrices through inversions
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- Title not available (Why is that?)
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- Counting weighted maximal chains in the circular Bruhat order
- Bruhat order of tournaments
- Title not available (Why is that?)
- The Bruhat order on classes of isotopic Latin squares
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices
- The Bruhat rank of a binary symmetric staircase pattern
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- More on the Bruhat order for (0, 1)-matrices
- Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
- On the Bruhat order of labeled graphs
Uses Software
This page was built for publication: The maximal length of a chain in the Bruhat order for a class of binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649577)
