The number of tiered posets modulo six (Q1086236)
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 3983164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of tiered posets modulo six |
scientific article; zbMATH DE number 3983164 |
Statements
The number of tiered posets modulo six (English)
0 references
1986
0 references
A poset on an n-set is said to be tiered with height h if every element belongs to a maximal chain with exactly h elements. The author proves that the number of such posets (summed over all \(h=1,...,n)\) is congruent to 1 and 3 (mod 6) for n odd and even, respectively. Thus a conjecture of \textit{G. Kreweras} [Discrete Math. 53, 147-149 (1985; Zbl 0558.05004)] is verified.
0 references
set enumeration
0 references
partially ordered set
0 references
tiered poset
0 references
0.8089837431907654
0 references
0.6902903914451599
0 references
0.6882979869842529
0 references
0.6859340667724609
0 references
0.6859340667724609
0 references
