On the number of connected components of random algebraic hypersurfaces
Yan Fyodorov, Antonio Lerario, Erik Lundberg

TL;DR
This paper analyzes the expected number of connected components of random algebraic hypersurfaces in projective space, establishing growth relations and bounds using invariant ensembles and random matrix theory.
Contribution
It introduces a growth relation for the expected number of components of random hypersurfaces based on univariate polynomial zero counts, using invariant ensembles and advanced probabilistic methods.
Findings
Expected components grow polynomially with the univariate case
Established upper and lower bounds for the expected number of components
Revealed super-exponential decay in specific models
Abstract
We study the expectation of the number of components of a random algebraic hypersurface defined by the zero set in projective space of a random homogeneous polynomial of degree . Specifically, we consider "invariant ensembles", that is Gaussian ensembles of polynomials that are invariant under an orthogonal change of variables. The classification due to E. Kostlan shows that specifying an invariant ensemble is equivalent to assigning a weight to each eigenspace of the spherical Laplacian. Fixing , we consider a family of invariant ensembles (choice of eigenspace weights) depending on the degree . Under a rescaling assumption on the eigenspace weights (as ), we prove that the order of growth of satisfies: $$\mathbb{E} b_{0}(X)=\Theta\left(\left[ \mathbb{E} b_0(X\cap \mathbb{R}P^1) \right]^{n} \right).…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
