paper

Computability of Equivariant Gröbner bases

arXiv:2507.08990

Abstract

Let be a field, be an infinite set (of indeterminates), and be a group acting on . An ideal in the polynomial ring is called equivariant if it is invariant under the action of . We show Gröbner bases for equivariant ideals are computable are hence the equivariant ideal membership is decidable when and satisfies the Hilbert's basis property, that is, when every equivariant ideal in is finitely generated. Moreover, we give a sufficient condition for the undecidability of the equivariant ideal membership problem. This condition is satisfied by the most common examples not satisfying the Hilbert's basis property.

Computability of Equivariant Gröbner bases · wovepaper