The number of real roots of a bivariate polynomial on a line
Martin Avendano
Abstract
We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line y=ax+b, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether a linear polynomial divides a bivariate polynomial (with exactly t non-zero terms) over a real number field K within [ log(H(f)H(a)H(b)) [K:Q] log(deg(f)) t]O(1) bit operations.
Create a lesson
Related papers
Morphism spaces on low degree hypersurfaces
Hrishabh Mishra
Connecting families of curves
Nathan Chen, Robert Lazarsfeld, Federico Moretti
The Last Picard Rank 1 Double-Mirror Calabi-Yau Pair?
Michał Kapustka, Marco Rampazzo, Prajwal Samal
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers II
Connor Stewart
The Hurwitz existence problem in prime degree
Jijian Song, Hailin Wen, Zebao Zhang
Conductor-Discriminant Inequality for Tamely Ramified Cyclic Covers I
Andrew Obus, Padmavathi Srinivasan, Connor Stewart