Flattening antichains with respect to the volume (Q1277137)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1247855
Language Label Description Also known as
default for all languages
No label defined
    English
    Flattening antichains with respect to the volume
    scientific article; zbMATH DE number 1247855

      Statements

      Flattening antichains with respect to the volume (English)
      0 references
      0 references
      0 references
      0 references
      2 February 1999
      0 references
      Given a (finite) poset \((P,\leq)\) with a strictly increasing function \(h:P\to N=\{0,1,2, \dots\}\), define the volume of a subset \(S\) of \(P\) (with respect to \(h\)) to be \(\sum_{x\in S} h(x)\). A subset \(S\) of \(P\) is flat (with respect to \(h)\) if \(x,y\in S\) with \(h(x)<h(y)\) implies there is no \(z\in P\) such that \(h(x)< h(z)<h(y)\). Thus, if \(P=B_n\), the lattice of subsets of \([n]=\{1, \dots, n\}\), and \(h(x)= | x|\), then \(S\) is flat if there exists a \(k\) such that every element of \(S\) has cardinality \(k\) or \(k+1\). There are many posets which are themselves flat with respect to some function \(h\). Many more (e.g., chains) have flat antichains only. It has been conjectured that \(B_n\) is among the posets which have the property that for every antichain there is a flat antichain with the same volume \((h(x)= | x|)\). Special cases occur in the literature. In this paper the conjecture is settled positively via a sequence of quite elegant technical lemmas based on results by Sperner, Clements and Daykin, among others. Rather than closing a area of inquiry it may also be the case that this paper can be adapted to a more general situation and lead to other interesting conjectures.
      0 references
      0 references
      poset
      0 references
      volume
      0 references
      flat
      0 references
      antichain
      0 references

      Identifiers