Tame and wild coordinates of Z[x,y].
algorithmautomorphisms of polynomial algebrastame automorphismstame coordinateswild automorphismswild coordinates
Actions of groups on commutative rings; invariant theory (13A50) Polynomials over commutative rings (13B25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)
For a commutative ring \(R\), the polynomial \(p\in R[x,y]\) is called a coordinate, if it is an image of \(x\) under some \(R\)-automorphism of \(R[x,y]\); the coordinate is tame if this automorphism is tame, i.e. a product of affine and triangular automorphisms. The known algorithms which decide whether \(p\in R[x,y]\) is a coordinate, and whether this coordinate is tame, work only in the case when \(R\) contains \(\mathbb Q\) [see the survey article of \textit{V. Drensky} and \textit{J.-T. Yu}, [in: Combinatorial and computational algebra Int. Conf. Combinatorial Comput. Algebra, 1999 Hong Kong, Contemp. Math. 264, 179--206 (2000; Zbl 0998.14026)]. In the paper under review, the authors further develop the existing machinery and give algorithms which determine whether a polynomial in two variables and with integer coefficients is a coordinate or a tame coordinate of \({\mathbb Z}[x,y]\). If the answer is positive, the algorithm provides also a corresponding automorphism. The considerations work also for polynomials over a unique factorization domain in the case of coordinates and over an Euclidean domain for tame coordinates.
- Algorithms for recognizing coordinates in two variables over UFD's
- Automorphisms and coordinates of polynomial algebras
- Coordinates in two variables over a $\mathbb {Q}$-algebra
- An algorithm for deciding tameness of polynomial automorphisms in three variables
- Endomorphisms preserving coordinates of polynomial algebras
- Two dimensional coordinate polynomials and dominant maps
- An algorithm to find a coordinate's mate
- A solution of the problem of van den Essen and Shpilrain
- Two-dimensional stable tameness over Noetherian domains of dimension one
- Stable tameness of two-dimensional polynomial automorphisms over a regular ring
- Automorphisms and coordinates of polynomial algebras
- scientific article; zbMATH DE number 4077461 (Why is no real title available?)
- scientific article; zbMATH DE number 1358157 (Why is no real title available?)
- scientific article; zbMATH DE number 3079627 (Why is no real title available?)
- Length 2 variables of \(A[x,y]\) and transfer
- Polynomial automorphisms and Gröbner reductions
- Polynomial automorphisms and the Jacobian conjecture
- Tame and Wild Coordinates of 𝐾[𝑧][𝑥,𝑦]
- The amalgamated free product structure of \(\mathrm{GL}_2(k[X_1,\dots ,X_n ])\) and the weak Jacobian theorem for two variables
- Adapting coordinates
- An algorithm to find a coordinate's mate
- Stably tame coordinates
- Coordinates and automorphisms of polynomial and free associative algebras of rank three.
- Algorithms for polynomials in two variables
- scientific article; zbMATH DE number 4131647 (Why is no real title available?)
- The Linear Coordinate Preserving Problem
- Algorithms for recognizing coordinates in two variables over UFD's
This page was built for publication: Tame and wild coordinates of \(\mathbb Z[x,y]\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880679)
