Pawlowski's asymptotic conjecture for the critical-point radius

About 2 years old · traced to

Let FF be a complex polynomial of degree n≥2n\geq 2 with zeros z1,…,znz_1,\dots,z_n satisfying ∣zk∣≤1|z_k|\leq 1, and critical points w1,…,wn−1w_1,\dots,w_{n-1}. Let γn\gamma_n be the radius of the smallest disk centered at 1n∑k=1nzk\frac{1}{n}\sum_{k=1}^n z_k that contains at least one critical point of FF. Pawlowski's conjecture. A sharp upper bound for γn\gamma_n should be asymptotically of the form

γn≤1−clog⁡nn\gamma_n\leq 1-c\frac{\log n}{n}

for some positive constant cc. Pawlowski's existing upper bound has a weaker asymptotic correction of order (log⁡n/n)2(\log n/n)^2; the paper does not report a resolution of this sharper asymptotic claim.

References

Primary source

Teng Zhang, “A refinement of Pawlowski's result”, arXiv:2411.07105 (2025).

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.