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:
“All his usual formalites of perfidy were observed with scrupulous technique.”
—Winston Churchill (1874–1965)
“If someone does something we disapprove of, we regard him as bad if we believe we can deter him from persisting in his conduct, but we regard him as mad if we believe we cannot. In either case, the crucial issue is our control of the other: the more we lose control over him, and the more he assumes control over himself, the more, in case of conflict, we are likely to consider him mad rather than just bad.”
—Thomas Szasz (b. 1920)