The Usual Case
Many authors in combinatorics define graded posets in such a way that all minimal elements of P must have rank 0, and moreover that there is a maximal rank r which is the rank of any maximal element. Then being graded means that all maximal chains have length r, as is indicated above. In this case one says that P has rank r.
Furthermore, in this case with the rank levels are associated the rank numbers or Whitney numbers . These numbers are defined by = number of elements of P having rank i .
The Whitney numbers are connected with a lot of important combinatorial theorems. The classic example is Sperner's theorem which can be formulated as follows:
- For the powerset of every finite set the maximum cardinality of a Sperner family equals the maximum Whitney number.
This means:
- Every finite powerset has the Sperner property
Read more about this topic: Graded Poset
Famous quotes containing the words usual and/or case:
“The usual complaint is: I have no other way of earning a living. The harsh reply can be: Do you have to live?”
—Tertullian (c. 150–230)
“Captain Quinlan: When this case is over, I’ll come around some night and sample some of your chili.
Tanya: Better be careful. May be too hot for you.”
—Orson Welles (1915–1985)