Algorithm for studying polynomial maps and reductions modulo prime number
DOI10.1016/j.jsc.2021.12.001zbMath1499.14102arXiv1904.05138OpenAlexW2937361803WikidataQ114154454 ScholiaQ114154454MaRDI QIDQ2117423
Paweł Bogdan, Elżbieta Sowa-Adamus
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
Jacobian problem (14R15) 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) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Cites Work
- Injective polynomial maps and the Jacobian conjecture
- Keller's problem
- Polynomial automorphisms and the Jacobian conjecture
- Mathematical problems for the next century
- An effective approach to Keller's Jacobian conjecture
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Reduction theorems for the Strong Real Jacobian Conjecture
- Keller Maps of Low Degree over Finite Fields
- The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
- An effective study of polynomial maps
- Pascal finite polynomial automorphisms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithm for studying polynomial maps and reductions modulo prime number
