Maximum antichains in the product of chains (Q2266031)

From MaRDI portal
Revision as of 16:13, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Maximum antichains in the product of chains
scientific article

    Statements

    Maximum antichains in the product of chains (English)
    0 references
    0 references
    0 references
    1984
    0 references
    Let P be the product \(k_ 1\times...\times k_ n\) which is a product of chains, where \(n\geq 1\) and \(k_ 1\geq...\geq k_ n\geq 2\). Theorem: The maximum ranks of P are its only maximum antichains if and only if either \(n=1\) or \(k_ 1-1\leq \sum^{n}_{i=2}(k_ i-1)\). This is a generalization of \textit{E. Sperner}'s Theorem [Math. Z. 27, 544-548 (1928; JFM 54.0090.06)]. The numbers and location of the maximum ranks of P are also determined.
    0 references
    product of chains
    0 references
    maximum ranks
    0 references
    maximum antichains
    0 references

    Identifiers