The number of roots of a lacunary bivariate polynomial on a line

DOI10.1016/j.jsc.2008.02.016zbMath1170.12003OpenAlexW1979687372MaRDI QIDQ1030257

Martín Avendano

Publication date: 1 July 2009

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.02.016

zbMATH Keywords

factorization of polynomialsDescartes' rule of signsnumber of rootsbivariate polynomialfewnomialslacunary polynomialsuper-sparse polynomial

Mathematics Subject Classification ID

Related Items (8)

Bounded-degree factors of lacunary multivariate polynomials ⋮ Descartes' rule of signs is exact! ⋮ Real zeros of mixed random fewnomial systems ⋮ A Wronskian approach to the real \(\tau\)-conjecture ⋮ A sharp bound on the number of real intersection points of a sparse plane curve with a line ⋮ On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem ⋮ On the Number of Real Zeros of Random Fewnomials ⋮ Fewnomial bounds for completely mixed polynomial systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring bivariate sparse (lacunary) polynomials
• Factoring polynomials with rational coefficients
• A polynomial time algorithm for diophantine equations in one variable
• Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces
• A simple counterexample to Kouchnirenko's conjecture
• Some bounds for the number of components of real zero sets of sparse polynomials
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• Factoring Polynomials over Algebraic Number Fields
• On the complexity of factoring bivariate supersparse (Lacunary) polynomials
• Bounds on the Number of Real Solutions to Polynomial Equations

This page was built for publication: The number of roots of a lacunary bivariate polynomial on a line