An algorithmic approach to the Polydegree Conjecture for plane polynomial automorphisms

DOI10.1016/j.jpaa.2019.04.002zbMath1433.14055arXiv1809.09681OpenAlexW2963307937WikidataQ123026568 ScholiaQ123026568MaRDI QIDQ2318359

Armin Straub, Kaitlyn Perry, Drew Lewis

Publication date: 15 August 2019

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.09681

zbMATH Keywords

polynomial automorphismsind-varietyalgorithmically decidable problempolydegree conjecture

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)

Related Items (1)

Automorphisms of algebraic varieties and infinite transitivity

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• The strong factorial conjecture
• Some families of polynomial automorphisms. III
• Conjugacy classes of special automorphisms of the affine spaces
• Plane polynomial automorphisms of fixed multidegree
• Polynomial automorphisms and the Jacobian conjecture
• On the length of polynomial automorphisms of the affine plane
• Closed subgroups of the polynomial automorphism group containing the affine subgroup
• Some families of polynomial automorphisms
• Some families of polynomial automorphisms. II.
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
• On the Closure of the Tame Automorphism Group of Affine Three-Space
• Dynamical properties of plane polynomial automorphisms
• On the maximality of the triangular subgroup
• Polynomial composition rigidity and plane polynomial automorphisms

This page was built for publication: An algorithmic approach to the Polydegree Conjecture for plane polynomial automorphisms