The number of tiered posets modulo six

DOI10.1016/0012-365X(86)90216-5MaRDI QIDQ1086236zbMATH OpenOpenAlexFDO

Authors David A. Klarner

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(86)90216-5

zbMATH Keywords

partially ordered setset enumerationtiered poset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partial orders, general (06A06)

Review text

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.

Recommendations

• Dénombrement des ordres étagés
• A bijective enumeration of tiered trees
• A unifying poset perspective on alternating sign matrices, plane partitions, Catalan objects, tournaments, and tableaux
• On numerical counting of prime, UPO, and the general type of posets according to heights
• The number of partially ordered sets with more points than incomparable pairs

Cites work

• Dénombrement des ordres étagés
• The number of graded partially ordered sets

Cited in

(2)

• Counting finite posets and topologies
• Dénombrement des ordres étagés

This page was built for publication: The number of tiered posets modulo six

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086236)