Algorithm for studying polynomial maps and reductions modulo prime number

DOI10.1016/J.JSC.2021.12.001zbMATH Open1499.14102arXiv1904.05138OpenAlexW2937361803WikidataQ114154454 ScholiaQ114154454MaRDI QIDQ2117423FDOQ2117423

Paweł Bogdan, Elżbieta Sowa

Publication date: 21 March 2022

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

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.

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

zbMATH Keywords

polynomial automorphismJacobian problem

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)

Cites Work

• Polynomial automorphisms and the Jacobian conjecture
• Mathematical problems for the next century
• Title not available (Why is that?)
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
• Title not available (Why is that?)
• An effective approach to Keller's Jacobian conjecture
• Keller's problem
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Injective polynomial maps and the Jacobian conjecture
• Reduction theorems for the strong real Jacobian conjecture
• Title not available (Why is that?)
• Keller Maps of Low Degree over Finite Fields
• An effective study of polynomial maps
• Pascal finite polynomial automorphisms

Cited In (3)

• Learning read-constant polynomials of constant degree modulo composites
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Reductions modulo primes of systems of polynomial equations and algebraic dynamical systems 👍 👎
• A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎

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)