Conjecture on Gaussian fluctuations of zero–critical-point distances

About 8 years old · traced to

For each zero Zk,nZ_{k,n} of a random polynomial pnp_n, let ζk,n\zeta_{k,n} be a nearest critical point, and define

dk,n:=∣Zk,n∣2nlog⁡n(n(Zk,n−ζk,n)−1Z‾k,n),d_{k,n}:=|Z_{k,n}|^2\sqrt{\frac n{\log n}}\left(n(Z_{k,n}-\zeta_{k,n})-\frac1{\overline{Z}_{k,n}}\right), χn:=∑k=1nδdk,n.\chi_n:=\sum_{k=1}^n\delta_{d_{k,n}}.

Here NC(0,1)\mathcal N_{\mathbb C}(0,1) denotes the standard normal distribution on C\mathbb C, and convergence is convergence in probability of the associated random measures. Gaussian fluctuation conjecture. For random polynomials with i.i.d. zeroes,

χn⟶PNC(0,1),as n→∞.\chi_n\overset{P}{\longrightarrow}\mathcal N_{\mathbb C}(0,1),\qquad\text{as }n\to\infty.

This is the refined fluctuation prediction for the pairing between zeroes and critical points, motivated by the second-order approximation in the source and supported there by numerical simulations; no proof or resolution is given in the supplied material.

References

Primary source

Zakhar Kabluchko and Hauke Seidel, “Distances between zeroes and critical points for random polynomials with i.i.d. zeroes”, arXiv:1807.02140 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.