Overdetermined systems of sparse polynomial equations
From MaRDI portal
Publication:2340503
DOI10.1007/s10208-014-9207-yzbMath1310.11119arXiv1307.5788OpenAlexW2065658438MaRDI QIDQ2340503
Louis Leroux, Francesco Amoroso, Martín Sombra
Publication date: 20 April 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5788
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Solving polynomial systems; resultants (13P15)
Related Items
Unlikely intersections and multiple roots of sparse polynomials, Computing the multilinear factors of lacunary polynomials without heights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic curves and multiplicative equations.
- The intersection of a curve with a union of translated codimension-two subgroups in a power of an elliptic curve
- Sparse complex polynomials and polynomial reducibility
- Some Problems of Unlikely Intersections in Arithmetic and Geometry (AM-181)
- Computing the torsion points of a variety defined by lacunary polynomials
- EXPONENTIAL SUMS EQUATIONS AND THE SCHANUEL CONJECTURE
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- On the Bounded Height Conjecture
- Lecture Notes on Diophantine Analysis
- Relations de d\'ependance et intersections exceptionnelles (Dependence relations and exceptional intersections)
- Anomalous Subvarieties—Structure Theorems and Applications
- On the reducibility of polynomials and in particular of trinomials
- Exponential diophantine equations