The spider poset is Macaulay (Q1976317): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090163613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4712283 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On posets whose products are Macaulay / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an equivalence in discrete extremal problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250148 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of a combinatorial theorem of macaulay / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4338928 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new short proof for the Kruskal-Katona theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bandwidth and density for block graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071752 / rank | |||
Normal rank |
Revision as of 14:52, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The spider poset is Macaulay |
scientific article |
Statements
The spider poset is Macaulay (English)
0 references
9 July 2000
0 references
Let \(Q(k, \ell)\) be the partially ordered set whose Hasse diagram can be obtained from \(k+1\) copies of a chain with \(l+1\) vertices by identifying their top vertices. Let \(Q^n(k,\ell)\) be the \(n\)th cartesian power of \(Q(k,\ell)\). It is proved that \(Q^n(k,\ell)\) is a Macaulay poset for any positive integers \(k, \ell\) and \(n\). That is, there exists a (new) linear order on the ground set of \(Q^n(k,\ell)\) such that the shadow of the first \(m\) elements (\(m\) arbitrary) of any level consists of the first elements of the neighbouring level and has minimum size with respect to the shadow of any \(m\)-element subset of the given level.
0 references
Macaulay poset
0 references
spider poset
0 references
Kruskal-Katona theorem
0 references
shadow minimization
0 references
Clements-Lindström theorem
0 references