arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.02540math.PRcs.CCmath.CA
收藏

一个随机稀疏多项式有多少个零点是实数?

How many zeros of a random sparse polynomial are real?

Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos

摘要:

研究了实数域上一元$k$ -稀疏多项式$f$的实零点个数,当$f$的系数来自独立的标准正态分布时.最近,Bürgisser,Ergür和Tonelli-Cueto证明了在这种情况下$f$的实零点的期望个数是有界的$O(\sqrt{k} \log k)$。在这项工作中,我们提高了$O(\sqrt{k})$的界限,并证明了这个界限是紧的,通过构建一个家庭的稀疏支持,其期望的实零点的数目是由$Ω(\sqrt{k})$下界。我们的主要技术是一个替代配方的Kac积分Edelman-Kostlan,使我们能够绑定的预期数量的零点的$f$在预期数量的零点的多项式较低的稀疏性。使用我们的技术,我们也恢复$O(\log n)$约束的预期数量的实零点的密集多项式的次数$n$与系数来自独立的标准正态分布。

英文摘要:

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 $O(\sqrt{k} \log k)$. In this work, we improve the bound to $O(\sqrt{k})$ 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 $Ω(\sqrt{k})$. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑