Pith. sign in

REVIEW 1 cited by

Concentration for the zero set of large random polynomial systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.11924 v2 pith:GT4ZZT63 submitted 2023-03-21 math.PR

classification math.PR
keywords proverandomsystemszeroconcentrationmeanparameterspolynomial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

For random systems of $K$ polynomials in $N + 1$ real variables which include the models of Kostlan (1987) and Shub and Smale (1993), we prove that the number of zeros on the unit sphere for $K = N$ or the Hausdorff measure of the zero set for $K < N$ concentrates around its mean as $N\to\infty$. To prove concentration we show that the variance of the latter random variable normalized by its mean goes to zero. The polynomial systems we consider depend on a set of parameters which determine the variance of their Gaussian coefficients. We prove that the convergence is uniform in those parameters and $K$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The impact of allocation strategies in subset learning on the expressive power of neural networks

    cs.LG 2025-02 conditional novelty 7.0 of 10

    In a teacher-student setup, maximal expressive power for a fixed learnable-weight budget is characterized by even row or column distribution in linear RNNs and feedforward networks.

Pith tools