In mathematics, a ranked poset is a partially ordered set in which one of the following (non-equivalent) conditions hold: it is

  • a graded poset, or
  • a poset with 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.[1]

References

  1. ↑ Richard Stanley, Enumerative Combinatorics, vol.1 p.99, Cambridge Studies in Advanced Mathematics 49, Cambridge University Press, 1995, ISBN 0-521-66351-2
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.