In mathematics, a ranked partially ordered set - or poset - may be either:
- a graded poset, or
- a poset that has the property that for every element x, all maximal chains among those with x as greatest element have the same finite length, or
- a poset in which all maximal chains have the same finite length.
The second definition differs from the first in that it requires all minimal elements to have the same rank; for posets with a least element, however, the two requirements are equivalent. The third definition is even more strict in that it excludes posets with infinite chains and also requires all maximal elements to have the same rank. Richard P. Stanley defines a graded poset of length n as one in which all maximal chains have length n.
Famous quotes containing the word ranked:
“If to be venerated for benevolence, if to be admired for talents, if to be esteemed for patriotism, if to be beloved for philanthropy, can gratify the human mind, you must have the pleasing consolation to know that you have not lived in vain. And I flatter myself that it will not be ranked among the least grateful occurrences of your life to be assured that, so long as I retain my memory, you will be thought on with respect, veneration, and affection by your sincere friend.”
—George Washington (1732–1799)