2000 character limit reached
Stably co-tame polynomial automorphisms over commutative rings
Published 6 Apr 2016 in math.AC, math.AG, and math.GR | (1604.01551v1)
Abstract: We say that a polynomial automorphism $\phi $ in $n$ variables is stably co-tame if the tame subgroup in $n$ variables is contained in the subgroup generated by $\phi $ and affine automorphisms in $n+1$ variables. In this paper, we give conditions for stably co-tameness of polynomial automorphisms.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.