Algorithm for studying polynomial maps and reductions modulo prime number

DOI10.1016/J.JSC.2021.12.001MaRDI QIDQ2117423zbMATH OpenOpenAlexWikidataFDO

Authors Paweł Bogdan, Elżbieta Sowa

Publication date 21 March 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

Jacobian problempolynomial automorphism

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10) Jacobian problem (14R15)

Abstract: In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of exponential automorphisms to positive characteristic. In this note we explore properties of the algorithm while using Segre homotopy and reductions modulo prime number. We give a method of retrieving an inverse of a given polynomial automorphism $F$ with integer coefficients form a finite set of the inverses of its reductions modulo prime numbers. Some examples illustrate effective aspects of our approach.

Review text

The authors studies the polynomial maps over \(\mathbb Q\). They gave an algorithm to find an inverse of a given polynomial automorphism with integer coefficient from a finite set of inverses of its reductions modulo prime numbers. In addition, they estimated the computational complexity and gave some examples.

Recommendations

• Iterations of integer polynomial maps modulo primes
• Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems
• A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
• scientific article; zbMATH DE number 5733040
• An iterative construction of irreducible polynomials reducible modulo every prime
• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• Polynomial products modulo primes and applications
• Integer Polynomials that are Reducible Modulo all Primes
• Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
• scientific article; zbMATH DE number 1504691

Cites work

• An effective approach to Keller's Jacobian conjecture
• An effective study of polynomial maps
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1767702 (Why is no real title available?)
• scientific article; zbMATH DE number 1797646 (Why is no real title available?)
• Injective polynomial maps and the Jacobian conjecture
• Keller maps of low degree over finite fields
• Keller's problem
• Mathematical problems for the next century
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Pascal finite polynomial automorphisms
• Polynomial automorphisms and the Jacobian conjecture
• Reduction theorems for the strong real Jacobian conjecture
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse

Cited in

(5)

• Learning read-constant polynomials of constant degree modulo composites
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• scientific article; zbMATH DE number 797380 (Why is no real title available?)
• Automorphisms of the \(k\)-algebra \(k[X_1, \ldots, X_m]\)
• A note on an algorithmic approach to inverting multivariate formal power series

This page was built for publication: Algorithm for studying polynomial maps and reductions modulo prime number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117423)