isMacaulay PisMacaulay SisMacaulay ISuppose $P$ is a ranked poset and $<$ is a total order on the ground set of $P$. Let $\operatorname{Seg}_d n$ denote the largest $n$ elements of rank $d$ with respect to $<$. Suppose that for every integer $d$ between $0$ and the rank of $P$, and for every subset $A$ of the $d$th level of $P$, we have $\lvert\nabla_P\operatorname{Seg}_d\lvert A\rvert\rvert \leq \lvert\nabla_P(A)\rvert$ and $\nabla_P\operatorname{Seg}_d\lvert A\rvert = \operatorname{Seg}_{d+1}\lvert\nabla_P(A)\rvert$. Then, we say $P$ is Macaulay with respect to $<$. A Macaulay poset is a poset for which there exists an order with respect to which it is Macaulay.
There is an analogous property for rings, not to be confused with the Cohen-Macaulay property.
Products of chains are Macaulay by the Clements-Lindstrom Theorem.
|
|
|
|
It is possible for a monomial poset to not be Macaulay.
|
|
|
If the poset is Macaulay, the option TikZ can provide a Hasse diagram in which the vertices are horizontally ordered according to a Macaulay order.
|
|
|
Given a QuotientRing or an Ideal, this method will not verify level linear independence.
The object isMacaulay is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/MacaulayPosets.m2:1624:0.