Bayer and Stillman showed that the regularity of generic initial ideals equal the regularity of theoriginal ideal with respect to the reverse lexicographic order. We show that rlex is the unique monomial order satisfying this property. This result sho...
Bayer and Stillman showed that the regularity of generic initial ideals equal the regularity of theoriginal ideal with respect to the reverse lexicographic order. We show that rlex is the unique monomial order satisfying this property. This result shows that rlex is the unique optimal monomial order for Grobner basis computation. We also show that generic initial ideals can fully characterize monomial orders.
We introduce a poset structure of monomial ideals. For a fixed homogeneous ideal I, consider ideals of the form I+(f) where f is a polynomial of degree d. If we restrict to ideals of the form in(I+(f)), then the relations in the poset are defined by the vanishing of particular Pluckercoordinates. We introduce the d-Lefschetz property of graded algebras and show that every graded algebra has the d-Lefschetz property in high degrees. We also show that for general f, I+(f) has a fixed initial ideal.
We introduce the d-Lefschetz property of graded algebras, which is a generalization of the weak and strong Lefschetz property. Our main theorem is that every graded algebra has the d-Lefschetz property in high degrees. Also, we introduce applications of this theorem on the Eisenbud-Green-Harris conjecture.