English

Reduction of the Finite Generation Problem for Leading Term Ideals under Arbitrary Rational Monomial Orders to the Lexicographic

Commutative Algebra 2026-07-28 v1

Abstract

A commutative ring RR is called a Gr\"obner ring if, for every n1n\geq 1, the leading term ideal of every finitely generated ideal of R[X1,,Xn]R[X_1,\ldots,X_n] is finitely generated with respect to the lexicographic order X1XnX_1\succ\cdots\succ X_n. We prove that this property is equivalent to the condition that, for every n1n\geq 1, every rational monomial order \prec on R[X1,,Xn]R[X_1,\ldots,X_n], and every finitely generated ideal IR[X1,,Xn]I\subseteq R[X_1,\ldots,X_n], the leading term ideal LT(I)\operatorname{LT}_{\prec}(I) is finitely generated. The construction uses a tagged monomial embedding, a compatible group grading, and dehomogenization. As an application, we apply this reduction to valuation rings and determine when the finite generation property holds for every rational monomial order. In particular, for valuation domains, this gives a proof of the rational monomial order version of the Gr\"obner ring conjecture.

Keywords

Cite

@article{arxiv.2607.25372,
  title  = {Reduction of the Finite Generation Problem for Leading Term Ideals under Arbitrary Rational Monomial Orders to the Lexicographic},
  author = {Xiaopeng Zheng},
  journal= {arXiv preprint arXiv:2607.25372},
  year   = {2026}
}