The MacaulayPosets package for Macaulay2
Penelope Beall, Nikola Kuzmanovski, Yu Oliver Li, Alexandra Seceleanu
TL;DR
The paper presents the MacaulayPosets package for Macaulay2, aimed at analyzing the Macaulay property for posets, especially monomial posets arising from graded rings. It extends the existing Posets framework by formalizing Macaulay posets, establishing connections to Hilbert functions, and enabling construction of complex posets and rings via four poset operations and two ring operations. A key contribution is providing monomial poset construction for non-monomial ideals, along with tools to check Macaulayness, obtain Macaulay orders, and visualize results. Overall, the package equips researchers with a systematic, computational pathway to explore the interplay between algebraic invariants like Hilbert functions and the combinatorial structure of posets and rings, with practical visualization capabilities.
Abstract
We introduce the package MacaulayPosets written for the computational algebra system Macaulay2. This package utilized the poset data type introduced in the Posets package and offers functionality for studying the Macaulay property for posets, particularly those which arise as monomial posets of commutative rings. A Macaulay poset is characterized by a ranked structure and a total order that interacts harmoniously with the partial order, enabling the establishment of bounds on the sizes of subsets of a given rank within an order ideal.
