Computability of Equivariant Gr\"obner bases
Abstract
Let K be a field, X be an infinite set (of indeterminates), and G be a group acting on X. An ideal in the polynomial ring K[X] is called equivariant if it is invariant under the action of G. We show Gr\"obner bases for equivariant ideals are computable are hence the equivariant ideal membership is decidable when G and X satisfies the Hilbert's basis property, that is, when every equivariant ideal in K[X] 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.