Solving polynomial systems in integers

DOI10.1134/S0001434615090059MaRDI QIDQ276637zbMATH OpenFDO

Authors M. E. Zelenova

Publication date 4 May 2016

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

homogeneous polynomial systeminteger solutionlifting algorithm

Mathematics Subject Classification ID

Diophantine equations in many variables (11D72) Solving polynomial systems; resultants (13P15)

Recommendations

• Numerically determining solutions of systems of polynomial equations
• Solving linear systems of equations over integers with Gröbner bases
• Algorithms for solving systems of linear Diophantine equations in integer domains
• Resolution of polynomial systems
• A homotopy for solving polynomial systems

Cites work

• scientific article; zbMATH DE number 3972969 (Why is no real title available?)
• scientific article; zbMATH DE number 2008939 (Why is no real title available?)
• scientific article; zbMATH DE number 3191380 (Why is no real title available?)
• scientific article; zbMATH DE number 3196340 (Why is no real title available?)
• Algebraic independence.
• Exact solution of linear equations using p-adic expansions
• Factoring polynomials with rational coefficients
• Solution of polynomial equations in the field of algebraic numbers
• Solving polynomial systems over finite fields: improved analysis of the hybrid approach

Cited in

(4)

• An approach to solving systems of polynomials via modular arithmetics with applications
• An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
• A special case of resolving polynomials
• Solving algebraic equations with integer structure analysis

This page was built for publication: Solving polynomial systems in integers

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