On posets, monomial ideals, Gorenstein ideals and their combinatorics

TL;DR

This paper explores the combinatorial and algebraic properties of monomial and Gorenstein ideals in polynomial rings, comparing socle elements, inverse systems, and poset structures, with computational insights into zero-dimensional Gorenstein ideals.

Contribution

It develops new combinatorial and algebraic frameworks for understanding socles, inverse systems, and Gorenstein ideals, highlighting differences between polynomial and local rings.

Findings

Comparison of socle elements and inverse systems for monomial ideals

Development of closure properties for the poset ^d

Explicit computations for zero-dimensional Gorenstein ideals

Abstract

In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a purely combinatorial way for monomial ideals, and then develop some closure operational properties for the related poset ${{\nats}_0^d}$. We then derive some algebraic propositions of $\Gamma$-graded rings that then have some combinatorial consequences. Interestingly, some of the results from this part that uniformly hold for polynomial rings are always false when the ring is local. We finally delve into some direct computations, w.r.t.~a given term order of the monomials, for general zero-dimensional Gorenstein ideals and deduce a few explicit observations and results for the inverse systems from some recent results about socles.