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 Enemy, who wears
Her mother’s usual face
And confidential tone,
Has access; doubtless stares
Into her writing case
And listens on the phone.”
—Phyllis McGinley (1905–1978)
“Half the testimony in the Bobbitt case sounded like Sally Jesse Raphael. Juries watch programs like this and are ready to listen.”
—William Geimer, U.S. law educator. New York Times, p. B18 (January 28, 1994)