On the number of connected components of random algebraic hypersurfaces
On the number of connected components of random algebraic hypersurfaces
复制标题
DOI:
10.1016/j.geomphys.2015.04.006
复制
发表时间:
2014-04
影响因子:
1.5
通讯作者:
Y. Fyodorov;A. Lerário;Erik Lundberg
中科院分区:
文献类型:
--
作者:
Y. Fyodorov;A. Lerário;Erik Lundberg
We study the expectation of the number of components b 0 (X) of a random algebraic hypersurface X defined by the zero set in projective space R P n of a random homogeneous polynomial f of degree d. Specifically, we consider invariant ensembles, that is Gaussian ensembles of polynomials that are invariant under an orthogonal change of variables. Fixing n, under some rescaling assumptions on the family of ensembles (as d→∞), we prove that E b 0 (X) has the same order of growth as [E b 0 (X∩ R P 1)] n. This relates the average number of components of X to the classical problem of M. Kac (1943) on the number of zeros of the random univariate polynomial f| R P 1. The proof requires an upper bound for E b 0 (X), which we obtain by counting extrema using Random Matrix Theory methods from Fyodorov (2013), and it also requires a lower bound, which we obtain by a modification of the barrier method from Lerario and Lundberg (2015) and Nazarov and Sodin (2009). We also provide quantitative upper bounds on implied constants; for the real Fubini–Study model these estimates provide super-exponential decay (as n→∞) of the leading coefficient (in d) of E b 0 (X).