The number of tiered posets modulo six
type: Item
instance of: scholarly article
title: The number of tiered posets modulo six
zbMATH Open document ID: 0608.05007
DOI: 10.1016/0012-365X(86)90216-5
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
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.
reviewed by: Indulis Strazdins
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 3983164
zbMATH Keywords: set enumeration
zbMATH Keywords: partially ordered set
zbMATH Keywords: tiered poset
author: David A. Klarner
MaRDI profile type: Publication
cites work: Dénombrement des ordres étagés
cites work: The number of graded partially ordered sets
full work available at URL: 0012-365x(86)90216-5
OpenAlex ID: W1971949455
description: scientific article; zbMATH DE number 3983164