The Polydegree Conjecture for plane polynomial automorphisms
The Polydegree Conjecture for plane polynomial automorphisms
Let be the group of polynomial automorphisms of the affine plane, and let denote the set of automorphisms with degree sequence . For a subset , write for its Zariski closure. Let , and let and be two degree sequences satisfying
Polydegree Conjecture. Then
This generalizes the known length-two case, where the topological degree constraint is sufficient when the shorter sequence has length one. The corresponding assertion in length three is known to fail in its direct form, while the general containment problem remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Drew Lewis, Kaitlyn Perry and Armin Straub, “An algorithmic approach to the Polydegree Conjecture for plane polynomial automorphisms”, arXiv:1809.09681 (2018).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.