2019
DOI: 10.1016/j.jpaa.2019.04.002
|View full text |Cite
|
Sign up to set email alerts
|

An algorithmic approach to the Polydegree Conjecture for plane polynomial automorphisms

Abstract: We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and show how it implies the Polydegree Conjecture. As the new conjecture is an ideal membership question, this shows that the Polydegree Conjecture is algorithmically decidable. We further describe how this approach provides a unified and shorter method of recovering existing re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Answering our question in Remark 5.7.2, D. Lewis, K. Perry, and A. Straub proved recently (see [35,Cor. 21]) that for n = 2 the group generated by the root subgroups H 1 = {(x, y) ↦ (x + t 1 y 2 , y)} and H 2 = {(x, y) ↦ (x, y + t 2 x)}, t 1 , t 2 ∈ K acts infinitely transitively on A 2 ∖ 0.…”
Section: 19mentioning
confidence: 73%
“…Answering our question in Remark 5.7.2, D. Lewis, K. Perry, and A. Straub proved recently (see [35,Cor. 21]) that for n = 2 the group generated by the root subgroups H 1 = {(x, y) ↦ (x + t 1 y 2 , y)} and H 2 = {(x, y) ↦ (x, y + t 2 x)}, t 1 , t 2 ∈ K acts infinitely transitively on A 2 ∖ 0.…”
Section: 19mentioning
confidence: 73%
“…1.3]; such subgroups are found explicitly in [And19]. For instance, for n = 2 the group G generated by two root subgroups U 1 = {(x, y) ↦ (x + t 1 y 2 , y)} and U 2 = {(x, y) ↦ (x, y + t 2 x)}, t 1 , t 2 ∈ k acts highly transitively on A 2 ∖ {0} equipped with the standard action of the 2-torus, see [LPS18,Cor. 21].…”
Section: Introductionmentioning
confidence: 99%