Algorithm for studying polynomial maps and reductions modulo prime number

We explore further properties of the algorithm and the class of Pascal finite maps described in Adamus et al. (2017), when using Segre homotopy and reductions modulo prime number. We consider polynomial maps over Q. Those can be transformed into maps with coefficients in Z by denominators clearing procedure. We give a method of retrieving an inverse of a given polynomial automorphism F with integer coefficients from a finite set of inverses of its reductions modulo prime numbers. We estimate the computational complexity of the proposed algorithm. Some examples illustrate effective aspects of our approach. (c) 2021 Elsevier Ltd. All rights reserved.