Abstract:
We show that a polynomial mapping of the type $ (x \rightarrow F[x+f(a(x)+b(y))],\, y \rightarrow G[y+g(c(x)+d(y))])$, where $(a,b,c,d,f,g,F,G)$ are polynomials with non-zero Jacobian is a composition of no more than 3 linear or triangular transformations. This result, however, leaves the possibility of existence of a counterexample of polynomial complexity two.
Keywords:analytical complexity.
UDC:517.55
Received: 22.12.2017 Received in revised form: 08.09.2018 Accepted: 04.10.2018