The command IsRanked(P) checks whether the partially ordered set P is ranked or not.

$\mathrm{with}\left(\mathrm{PartiallyOrderedSets}\right)\:$

$U≔\left\{1\,2\,3\right\}\:$

$T≔\left\{3\,4\,5\,6\,7\,8\,9\right\}\:$

$\mathrm{divisibility}≔\left(x\,y\right)\mapsto \mathrm{irem}\left(y\,x\right)=0$

$\mathrm{divisibility}≔\left(x\,y\right)\mapsto \mathrm{irem}\left(y\,x\right)=0$

$V≔\varnothing \&colon;$$\mathrm{leq}≔\mathrm{`<=`}\&colon;$$\mathrm{empty\_poset}≔\mathrm{PartiallyOrderedSet}\left(V\&comma;\mathrm{leq}\right)$

$\mathrm{empty\_poset}≔\mathrm{<\; a\; poset\; with\; 0\; elements\; >}$

$\mathrm{IsRanked}\left(\mathrm{empty\_poset}\right)$

$\mathrm{true}$

$\mathrm{adjList5}≔\mathrm{map2}\left(\mathrm{map}\&comma;\mathrm{`+`}\&comma;\mathrm{Array}\left(\left[\left\{1\&comma;4\&comma;7\right\}\&comma;\left\{2\&comma;6\right\}\&comma;\left\{3\right\}\&comma;\left\{4\right\}\&comma;\left\{5\right\}\&comma;\left\{6\right\}\&comma;\left\{7\right\}\right]\right)\&comma;2\right)$

$\mathrm{adjList5}≔\left[\begin{array}{ccccccc}\left\{3\&comma;6\&comma;9\right\}& \left\{4\&comma;8\right\}& \left\{5\right\}& \left\{6\right\}& \left\{7\right\}& \left\{8\right\}& \left\{9\right\}\end{array}\right]$

$\mathrm{poset5}≔\mathrm{PartiallyOrderedSet}\left(\mathrm{convert}\left(T\&comma;'\mathrm{list}'\right)\&comma;\mathrm{adjList5}\right)$

$\mathrm{poset5}≔\mathrm{<\; a\; poset\; with\; 7\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset5}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset5}\right)$

$\mathrm{false}$

$G≔\mathrm{GraphTheory}:-\mathrm{Graph}\left(\mathrm{directed}\&comma;\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\right]\&comma;\left\{\left[1\&comma;1\right]\&comma;\left[1\&comma;2\right]\&comma;\left[1\&comma;3\right]\&comma;\left[1\&comma;4\right]\&comma;\left[1\&comma;5\right]\&comma;\left[1\&comma;6\right]\&comma;\left[2\&comma;2\right]\&comma;\left[2\&comma;4\right]\&comma;\left[2\&comma;6\right]\&comma;\left[3\&comma;3\right]\&comma;\left[3\&comma;5\right]\&comma;\left[3\&comma;6\right]\&comma;\left[4\&comma;4\right]\&comma;\left[4\&comma;6\right]\&comma;\left[5\&comma;5\right]\&comma;\left[5\&comma;6\right]\&comma;\left[6\&comma;6\right]\right\}\right)$

$G≔\mathrm{Graph\; 1:\; a\; directed\; graph\; with\; 6\; vertices,\; 11\; arcs,\; and\; 6\; self-loops}$

$\mathrm{poset6}≔\mathrm{PartiallyOrderedSet}\left(G\right)$

$\mathrm{poset6}≔\mathrm{<\; a\; poset\; with\; 6\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset6}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset6}\right)$

$\mathrm{true}$

$\mathrm{poset7}≔\mathrm{PartiallyOrderedSet}\left(\mathrm{convert}\left(U\&comma;'\mathrm{list}'\right)\&comma;⟨⟨1\left|1\right|0⟩\&comma;⟨0\left|1\right|1⟩\&comma;⟨0\left|0\right|1⟩⟩\&comma;\mathrm{input}=\mathrm{transitivereduction}\right)$

$\mathrm{poset7}≔\mathrm{<\; a\; poset\; with\; 3\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset7}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset7}\right)$

$\mathrm{true}$

$\mathrm{poset8}≔\mathrm{PartiallyOrderedSet}\left(\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\right]\&comma;\mathrm{Array}\left(\left[\left\{1\&comma;2\&comma;3\right\}\&comma;\left\{2\&comma;4\right\}\&comma;\left\{3\&comma;5\right\}\&comma;\left\{4\&comma;6\right\}\&comma;\left\{5\&comma;6\right\}\&comma;\left\{6\right\}\right]\right)\&comma;\mathrm{input}=\mathrm{transitivereduction}\right)$

$\mathrm{poset8}≔\mathrm{<\; a\; poset\; with\; 6\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset8}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset8}\right)$

$\mathrm{true}$

$t≔\mathrm{PolyhedralSets}:-\mathrm{ExampleSets}:-\mathrm{Octahedron}\left(\right)$

$t≔\&lcub;\begin{array}{lll}\mathrm{Coordinates}& \&colon;& \left[x_1\&comma;x_2\&comma;x_3\right]\\ \mathrm{Relations}& \&colon;& \left[-x_1-x_2-x_3\le 1\&comma;-x_1-x_2+x_3\le 1\&comma;-x_1+x_2-x_3\le 1\&comma;-x_1+x_2+x_3\le 1\&comma;x_1-x_2-x_3\le 1\&comma;x_1-x_2+x_3\le 1\&comma;x_1+x_2-x_3\le 1\&comma;x_1+x_2+x_3\le 1\right]\end{array}$

$d≔\mathrm{PolyhedralSets}:-\mathrm{Dimension}\left(t\right)$

$d≔3$

$\mathrm{t\_faces}≔\left\{\mathrm{seq}\left(\mathrm{op}\left(\mathrm{PolyhedralSets}:-\mathrm{Faces}\left(t\&comma;\mathrm{dimension}=i\right)\right)\&comma;i=-0..d\right)\right\}\&colon;$

$\mathrm{t\_faces}≔\mathrm{t\_faces}\mathbf{union}\left\{\mathrm{PolyhedralSets}:-\mathrm{ExampleSets}:-\mathrm{EmptySet}\left(d\right)\right\}\&colon;$

$\mathrm{FL}≔\mathrm{convert}\left(\mathrm{t\_faces}\&comma;\mathrm{list}\right)\&colon;$

inclusion := proc(x,y) PolyhedralSets:-`subset`(FL[x],FL[y]) end proc:

$\mathrm{polyhedral\_poset}≔\mathrm{PartiallyOrderedSet}\left(\left\{\mathrm{seq}\left(i\&comma;i=1..\mathrm{nops}\left(\mathrm{FL}\right)\right)\right\}\&comma;\mathrm{inclusion}\right)$

$\mathrm{polyhedral\_poset}≔\mathrm{<\; a\; poset\; with\; 28\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{polyhedral\_poset}\right)$

$\mathrm{IsRanked}\left(\mathrm{polyhedral\_poset}\right)$

$\mathrm{true}$

$M≔\mathrm{Matrix}\left(\left[\left[1\&comma;1\&comma;1\&comma;1\&comma;1\right]\&comma;\left[0\&comma;1\&comma;1\&comma;0\&comma;1\right]\&comma;\left[0\&comma;0\&comma;1\&comma;0\&comma;1\right]\&comma;\left[0\&comma;0\&comma;0\&comma;1\&comma;1\right]\&comma;\left[0\&comma;0\&comma;0\&comma;0\&comma;1\right]\right]\right)\&colon;$

$\mathrm{poset9}≔\mathrm{PartiallyOrderedSet}\left(\left[\mathrm{seq}\left(1..5\right)\right]\&comma;M\right)$

$\mathrm{poset9}≔\mathrm{<\; a\; poset\; with\; 5\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset9}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset9}\right)$

$\mathrm{false}$

$Z≔\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\&comma;10\&comma;12\&comma;15\&comma;20\&comma;30\&comma;60\right\}$

$Z≔\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\&comma;10\&comma;12\&comma;15\&comma;20\&comma;30\&comma;60\right\}$

$\mathrm{poset10}≔\mathrm{PartiallyOrderedSet}\left(Z\&comma;\mathrm{divisibility}\right)$

$\mathrm{poset10}≔\mathrm{<\; a\; poset\; with\; 12\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset10}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset10}\right)$

$\mathrm{true}$

$\mathrm{ZZ}≔\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\&comma;12\&comma;15\&comma;60\right\}$

$\mathrm{ZZ}≔\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\&comma;12\&comma;15\&comma;60\right\}$

$\mathrm{poset11}≔\mathrm{PartiallyOrderedSet}\left(\mathrm{ZZ}\&comma;\mathrm{divisibility}\right)$

$\mathrm{poset11}≔\mathrm{<\; a\; poset\; with\; 9\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset11}\right)$

$\mathrm{IsRanked}\left(\mathrm{poset11}\right)$

$\mathrm{false}$

Richard P. Stanley: Enumerative Combinatorics 1. 1997, Cambridge Studies in Advanced Mathematics. Vol. 49. Cambridge University Press.

The PartiallyOrderedSets[IsRanked] command was introduced in Maple 2025.

For more information on Maple 2025 changes, see Updates in Maple 2025.