Forum Problem Lists Definitions FAQ

17.15 (2010)

Open

Construct an algorithm which, for a given polynomial $f \in \mathbb{Z}[x_1, x_2, \dots, x_n]$, finds (explicitly, in terms of generators) the maximal subgroup $G_f$ of the group $\text{Aut}(\mathbb{Z}[x_1, x_2, \dots, x_n])$ that leaves $f$ fixed. This question is related to description of the solution set of the Diophantine equation $f = 0$.

Contributor: V. G. Bardakov

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.