On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) (Q1943693): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11083-011-9241-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987495414 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60692017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the Bruhat order for (0, 1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal length of a chain in the Bruhat order for a class of binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing integral matrices with given line sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (0, 1)-matrices with prescribed row and column sum vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of possible row and column sums of \(0,1\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\) / rank
 
Normal rank

Latest revision as of 06:52, 6 July 2024

scientific article
Language Label Description Also known as
English
On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
scientific article

    Statements

    On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) (English)
    0 references
    0 references
    0 references
    0 references
    20 March 2013
    0 references
    Bruhat order
    0 references
    row and column sum vectors
    0 references
    (0, 1)-matrices
    0 references
    antichains
    0 references

    Identifiers