The chain poset on $n$ elements is the total order on the integers $1..n$.
i1 : n = 5; |
i2 : C = chain n o2 = C o2 : Poset |
i3 : C == poset(toList(1..n), (a,b) -> a <= b) o3 = true |
It is also the divisorPoset of a prime $p$ to the $n-1$ power.
i4 : C == divisorPoset(2^(n-1)) o4 = true |
The object chain is a method function.