Gorav Jindal
ABSTRACT
We investigate the number of real zeros of a univariate k-sparse polynomial f over the reals, when the coefficients of f come from independent standard normal distributions. Recently Bürgisser, Ergür and Tonelli-Cueto showed that the expected number of real zeros of f in such cases is bounded by [EQUATION]. In this work, we improve the bound to [EQUATION] and also show that this bound is tight by constructing a family of sparse support whose expected number of real zeros is lower bounded by [EQUATION]. Our main technique is an alternative formulation of the Kac integral by Edelman-Kostlan which allows us to bound the expected number of zeros of f in terms of the expected number of zeros of polynomials of lower sparsity. Using our technique, we also recover the O (log n) bound on the expected number of real zeros of a dense polynomial of degree n with coefficients coming from independent standard normal distributions.
- Frédéric Bihan and Frank Sottile. 2007. New fewnomial upper bounds from Gale dual polynomial systems. Mosc. Math. J. 7, 3 (2007), 387--407, 573. Google Scholar
Cross Ref
- Lenore Blum, Felipe Cucker, Michael Shub, and Steve Smale. 1998. Complexity and real computation. Springer-Verlag, New York. xvi+453 pages. With a foreword by Richard M. Karp. Google ScholarCross Ref
- Irénée Briquel and Peter Bürgisser. 2020. The real tau-conjecture is true on average. Random Structures & Algorithms (2020). arXiv:https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20926 Google ScholarCross Ref
- Peter Bürgisser. 2009. On defining integers and proving arithmetic circuit lower bounds. Comput. Complexity 18, 1 (2009), 81--103. Google ScholarDigital Library
- Peter Bürgisser, Ergür Alperen A., and Josué Tonelli-Cueto. 2019. On the Number of Real Zeros of Random Fewnomials. SIAM Journal on Applied Algebra and Geometry 3, 4 (2019), 721--732.Google ScholarCross Ref
- René Descartes. 1886. La géométrie. Hermann.Google Scholar
- Alan Edelman and Eric Kostlan. 1995. How many zeros of a random polynomial are real? Bull. Amer. Math. Soc. (N.S.) 32, 1 (1995), 1--37. Google ScholarCross Ref
- Paul Erdös and A. C. Offord. 1956. On the number of real roots of a random algebraic equation. Proc. London Math. Soc. (3) 6 (1956), 139--160. Google ScholarCross Ref
- Boulos El Hilany. 2016. Géométrie Tropicale et Systèmes Polynomiaux. Ph.D. Dissertation. LAMA, Universite Savoie Mont Blanc et de Universite Grenoble Alpes.Google Scholar
- A. G. Hovanskiĭ. 1980. A class of systems of transcendental equations. Dokl. Akad. Nauk SSSR 255, 4 (1980), 804--807.Google Scholar
- Pavel Hrubes. 2013. On the Real τ-Conjecture and the Distribution of Complex Roots. Theory of Computing 9 (2013), 403--411. Google ScholarCross Ref
- M. Kac. 1943. On the average number of real roots of a random algebraic equation. Bull. Amer. Math. Soc. 49 (1943), 314--320. Google ScholarCross Ref
- A. G. Khovanskiĭ. 1991. Fewnomials. Translations of Mathematical Monographs, Vol. 88. American Mathematical Society, Providence, RI. viii+139 pages. Translated from the Russian by Smilka Zdravkovska.Google Scholar
- Pascal Koiran. 2011. Shallow circuits with high-powered inputs. In Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 7--9, 2011. Proceedings. 309--320. http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/5.htmlGoogle Scholar
- Pascal Koiran, Natacha Portier, and Sébastien Tavenas. 2015. A Wronskian approach to the real τ-conjecture. J. Symb. Comput. 68 (2015), 195--214. Google ScholarDigital Library
- Pascal Koiran, Natacha Portier, Sébastien Tavenas, and Stéphan Thomassé. 2015. A τ-Conjecture for Newton Polygons. Foundations of Computational Mathematics 15, 1 (2015), 185--197. Google ScholarDigital Library
- A. Kushnirenko. 26 February 2008. Letter to Frank Sottile. www.math.tamu.edu/~sottile/research/pdf/kushnirenko.pdf.Google Scholar
- J. E. Littlewood and A. C. Offord. 1938. On the Number of Real Roots of a Random Algebraic Equation. J. London Math. Soc. 13, 4 (1938), 288--295. Google ScholarCross Ref
- Gregorio Malajovich and J. Maurice Rojas. 2004. High probability analysis of the condition number of sparse polynomial systems. Theoret. Comput. Sci. 315, 2--3 (2004), 524--555. Google ScholarDigital Library
- J. Maurice Rojas. 1996. On the average number of real roots of certain random sparse polynomial systems. In The mathematics of numerical analysis (Park City, UT, 1995). Lectures in Appl. Math., Vol. 32. Amer. Math. Soc., Providence, RI, 689--699.Google Scholar
- Ramprasad Saptharishi. 2015. A survey of lower bounds in arithmetic circuit complexity. Github survey (2015).Google Scholar
- Amir Shpilka and Amir Yehudayoff. 2010. Arithmetic Circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5, 3--4 (2010), 207--388. Google ScholarDigital Library
- Michael Shub and Steve Smale. 1995. On the intractability of Hilbert's Nullstellensatz and an algebraic version of "NP ≠ P?". Duke Math. J. 81 (1995), 47--54 (1996). A celebration of John F. Nash, Jr. Google ScholarCross Ref
- Frank Sottile. 2011. Real solutions to equations from geometry. University Lecture Series, Vol. 57. American Mathematical Society, Providence, RI. x+200 pages. Google ScholarCross Ref
Index Terms
- How many zeros of a random sparse polynomial are real?
Recommendations
On the expected number of real roots of polynomials and exponential sums
AbstractThe expected number of real projective roots of orthogonally invariant random homogeneous real polynomial systems is known to be equal to the square root of the Bézout number. A similar result is known for random multi-homogeneous ...
Efficiently Computing Real Roots of Sparse Polynomials
ISSAC '17: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic ComputationWe propose an efficient algorithm to compute the real roots of a sparse polynomial f∈R[x] having k non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient ...
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
In this paper, the use of an efficient sparse minor expansion method to directly compute the subresultants needed for the greatest common denominator (GCD) of two polynomials is described. The sparse minor expansion method (applied either to Sylvester's ...
Comments