An effective algorithm for deciding the solvability of a system of polynomial equations over p-adic integers

DOI10.1090/SPMJ/1740MaRDI QIDQ5047971zbMATH OpenOpenAlexFDO

Authors A. L. Chistov

Publication date 17 November 2022

Published in St. Petersburg Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/spmj/1740

zbMATH Keywords

\(p\)-adic integersdecidability algorithmpolynomial systems

Mathematics Subject Classification ID

(p)-adic and power series fields (11D88) Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05) Computational aspects of higher-dimensional varieties (14Q15)

Recommendations

• Roots of polynomials in p-adic fields
• Solvability of systems of diagonal equations over p-adic local fields
• On reducing a system of equations to a single equation
• Some sufficient conditions for the solvability of p-adic polynomial equations
• scientific article; zbMATH DE number 4065116

Cites work

• A CRITERION FOR THE p-ADIC SOLUBILITY OF DIOPHANTINE EQUATIONS
• An improvement of the complexity bound for solving systems of polynomial equations
• Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
• scientific article; zbMATH DE number 3893304 (Why is no real title available?)
• scientific article; zbMATH DE number 3075369 (Why is no real title available?)
• Résolution des systèmes d'équations algébriques
• Sharp Effective Nullstellensatz
• Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I

Cited in

(5)

• Roots of polynomials in p-adic fields
• Solvability of a system of polynomial equations modulo primes
• Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
• An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
• Solving polynomial systems over non-fields and applications to modular polynomial factoring

This page was built for publication: An effective algorithm for deciding the solvability of a system of polynomial equations over \(p\)-adic integers

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