The Polydegree Conjecture for plane polynomial automorphisms

From papers

Let G=G(C)\mathcal{G}=\mathcal{G}(\mathbb{C}) be the group of polynomial automorphisms of the affine plane, and let G(d1,,dk)\mathcal{G}_{(d_1,\ldots,d_k)} denote the set of automorphisms with degree sequence (d1,,dk)(d_1,\ldots,d_k). For a subset AGA\subset\mathcal{G}, write A\overline{A} for its Zariski closure. Let k<lk<l, and let (d1,,dk)(d_1,\ldots,d_k) and (e1,,dl)(e_1,\ldots,d_l) be two degree sequences satisfying

d1++dk<e1++el.d_1+\cdots+d_k<e_1+\cdots+e_l.

Polydegree Conjecture. Then

G(d1,,dk)G(e1,,el).\mathcal{G}_{(d_1,\ldots,d_k)}\subset\overline{\mathcal{G}_{(e_1,\ldots,e_l)}}.

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

No solutions have been posted yet.