Schmeisser’s Conjecture in Large Degree
Version 1 / Nov 06, 2026 / CC BY 4.0
Abstract
We prove Schmeisser’s conjecture for all sufficiently large degrees.
Provenance statement
References
- J. Dégot, Sendov conjecture for high degree polynomials , Proc. Amer. Math. Soc. 142 (2014), 1337--1349. arXiv:1106.4126v2 (https://arxiv.org/abs/1106.4126v2).arXiv
- W. K. Hayman, Research Problems in Function Theory , Athlone Press, London, 1967.
- W. K. Hayman and E. F. Lingham, Research Problems in Function Theory , fiftieth anniversary ed., Springer, Cham, 2019.
- L. Mazur, A computer-assisted proof of Sendov's conjecture , revision 14, 2026. ProofAtlas (https://www.proofatlas.ai/research/sendov-conjecture-proof-candidate/).link
- P. Pawłowski, On the zeros of a polynomial and its derivatives , Trans. Amer. Math. Soc. 350 (1998), 4461--4472.
- G. Schmeisser, Bemerkungen zu einer Vermutung von Ilieff , Math. Z. 111 (1969), 121--125.
- G. Schmeisser, Zur Lage der kritischen Punkte eines Polynoms , Rend. Sem. Mat. Univ. Padova 46 (1971), 405--415.
- G. Schmeisser, On Ilieff's conjecture , Math. Z. 156 (1977), 165--173.
- G. Schmeisser, Majorization of the critical points of a polynomial by its zeros , Comput. Methods Funct. Theory 3 (2003), 95--103.
- T. Tao, Sendov's conjecture for sufficiently-high-degree polynomials , Acta Math. 229 (2022), 347--392.
Show all 12 referencesShow fewer references
Version history
- v1 · 21 pagesSubmitted by Qiyue TangInitial depositCurrentNov 06, 2026