加载中…
Bayer-Stillman showed that when is the graded reverse lexicographic order. We show that the reverse lexicographic order is the unique monomial order satisfying $reg(I) = reg(gin_\tau(I))Igin_{\tau_1}(I) = gin_{\tau_2}(I)I\tau_1 = \tau_2$.

生成讲解博客的中文版本

生成AI智能校验的中文版本