Reduction of the Finite Generation Problem for Leading Term Ideals under Arbitrary Rational Monomial Orders to the Lexicographic
Abstract
A commutative ring is called a Gr\"obner ring if, for every , the leading term ideal of every finitely generated ideal of is finitely generated with respect to the lexicographic order . We prove that this property is equivalent to the condition that, for every , every rational monomial order on , and every finitely generated ideal , the leading term ideal 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}
}