Schmeisser's weighted generalization of Sendov's conjecture

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, all satisfying ∣zk∣≤1|z_k|\leq 1, and critical points w1,…,wn−1w_1,\dots,w_{n-1}. Let l1,…,lnl_1,\dots,l_n be nonnegative weights satisfying

∑k=1nlk=1.\sum_{k=1}^n l_k=1.

Schmeisser's conjecture. For every such choice of weights,

min⁡1≤j≤n−1∣∑k=1nlkzk−wj∣≤1.\min_{1\leq j\leq n-1}\left|\sum_{k=1}^n l_kz_k-w_j\right|\leq 1.

This generalizes Sendov's conjecture by replacing an individual zero with an arbitrary convex combination of the zeros; the paper gives no resolution.

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.