ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (εk)(\varepsilon_k) be an i.i.d. sequence of standard Gaussian random variables, and let

fn(x)=∑k=0nckεkxkf_n(x)=\sum_{k=0}^n c_k\varepsilon_k x^k

with (ck)(c_k) a bounded sequence of real numbers. For α∈(0,1)\alpha\in(0,1), write RnR_n for the number of real roots of fnf_n.

O. Nguyen's conjecture. Given α∈(0,1)\alpha\in(0,1), there exists a bounded sequence (ck)(c_k) of real numbers such that

ERn=nα+o(1).\mathbb E R_n=n^{\alpha+o(1)}.

This conjecture asks whether random polynomials with Gaussian coefficients can realize every intermediate power-law order of expected real roots between the logarithmic and linear regimes. The surrounding discussion cites known logarithmic, square-root, and linear-root regimes, but provides no resolution of the conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.