pith. sign in

arxiv: 1410.5969 · v2 · pith:VJEPHZUEnew · submitted 2014-10-22 · 🧮 math.AC

The converse of a theorem by Bayer and Stillman

classification 🧮 math.AC
keywords orderlexicographicreversebayerbayer-stillmanconversegradedideals
0
0 comments X
read the original abstract

Bayer-Stillman showed that $reg(I) = reg(gin_\tau(I))$ when $\tau$ is the graded reverse lexicographic order. We show that the reverse lexicographic order is the unique monomial order $\tau$ satisfying $reg(I) = reg(gin_\tau(I))$ for all ideals $I$. We also show that if $gin_{\tau_1}(I) = gin_{\tau_2}(I)$ for all $I$, then $\tau_1 = \tau_2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.