English

Computability of Equivariant Gr\"obner bases

Logic in Computer Science 2025-07-15 v1 Commutative Algebra

Abstract

Let K\mathbb{K} be a field, X\mathcal{X} be an infinite set (of indeterminates), and G\mathcal{G} be a group acting on X\mathcal{X}. An ideal in the polynomial ring K[X]\mathbb{K}[\mathcal{X}] is called equivariant if it is invariant under the action of G\mathcal{G}. We show Gr\"obner bases for equivariant ideals are computable are hence the equivariant ideal membership is decidable when G\mathcal{G} and X\mathcal{X} satisfies the Hilbert's basis property, that is, when every equivariant ideal in K[X]\mathbb{K}[\mathcal{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.

Cite

@article{arxiv.2507.08990,
  title  = {Computability of Equivariant Gr\"obner bases},
  author = {Arka Ghosh and Aliaume Lopez},
  journal= {arXiv preprint arXiv:2507.08990},
  year   = {2025}
}
R2 v1 2026-07-01T03:57:22.901Z