
TL;DR
This paper explores the relationship between Macaulay posets and rings, establishing a correspondence that enables transferring results between algebraic and combinatorial structures, and extends classical theorems to broader classes of rings.
Contribution
It introduces a Macaulay Correspondence Theorem linking Macaulay rings and posets, and extends key results to non-square-free rings, classifies tensor products of tree rings, and provides new examples of Macaulay rings.
Findings
Established a Macaulay Correspondence Theorem.
Extended the Mermin-Murai Theorem to non-square-free rings.
Classified tensor products of tree rings and identified new classes of Macaulay rings.
Abstract
Macaulay posets are posets in which an analog of the Kruskal-Katona Theorem holds. Macaulay rings (also called Macaulay-Lex rings) are rings in which an analog of Macaulay's Theorem for lex ideals holds. The study of both of these objects started with Macaulay almost a century ago. Since then, these two branches have developed separately over the past century, with the last link being the Clements-Lindstr\"om Theorem. For every ring that is the quotient of a polynomial ring by a homogeneous ideal we define the poset of monomials. Under certain conditions, we prove a Macaulay Correspondence Theorem, a ring is Macaulay if and only if its poset of monomials is Macaulay. Furthermore, the tensor product of rings corresponds to the Cartesian product of the posets of monomials. This allows us to transfer results between rings and posets. By using this translation, we give several answers to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Algebraic structures and combinatorial models · Rings, Modules, and Algebras
