This method generates the divisor poset of $n$ with elements which are multiples of $n$.
i1 : R = QQ[x,y]; |
i2 : divisorPoset(x*y-x, x^2*y^2 - 2*x^2*y + x^2)
o2 = Relation Matrix: | 1 1 1 1 |
| 0 1 0 1 |
| 0 0 1 1 |
| 0 0 0 1 |
o2 : Poset
|