Skip to content

A COMPUTER-ASSISTED PROOF OF SENDOV’S CONJECTURE

· 5 citations · 9 references

TL;DR

A computer-assisted proof of Sendov’s conjecture that each zero a of p has a critical point within distance one is presented and a strict master error theorem proves the reverse inequality.

View source

Similar papers

Preprint Sep 2026

A Proof of Fraenkel's Conjecture

Fraenkel's conjecture asserts that a partition of the integers into at least three Beatty sequences with distinct moduli has the binary densities $1,2,4,\ldots,2^{m-1}$, normalized by $2^m-1$. We prove the conjecture through a dimension-free intermediate statement: every such partition contains a component of density a...

Hui-Yue Tan, Ying Zhang · 0 citations
Preprint Sep 2026

The Hurwitz existence problem in prime degree

Let $p$ be a prime. We prove that every compatible branch datum of degree $p$ over the sphere is realizable by a connected branched cover. The three-point case is constructed in residue characteristic $p$. Henrio's moment theorem supplies the distinct-point moment solutions from which we construct a special primitive t...

Ji-Jian Song, Hai-Lin Wen, Ze-Bao Zhang · 0 citations
Preprint Oct 2026

A computer-assisted proof of Krzy\.z's conjecture for the sixth coefficient

We prove Krzy\.z's conjecture for the sixth coefficient. Every holomorphic function $f(z)=\sum a_kz^k$ from the unit disk to the punctured disk satisfies $|a_6| \le 2/e$. Equality holds precisely for rotations of $\exp(-(1-z^6)/(1+z^6))$. Every extremal has a Herglotz representation with at most six atoms. By the reduc...

Frank Wikström · 0 citations
Preprint Sep 2026

Borsuk-Ulam type theorem for the orthogonal group and orthogonal four-partitions

Makeev [2] stated that every finite Borel measure in $\mathbb R^d$ assigning zero mass to hyperplanes can be cut by $d$ mutually orthogonal hyperplanes so that every pair divides the measure into four equal parts, and outlined a proof strategy, but the key steps were left incomplete. We give a direct and elementary pro...

O. Musin · 1 citation
Preprint Sep 2026

A Quadratic Lower Bound on Determinantal Complexity

We prove an $\Omega(n^2)$ lower bound on the determinantal complexity of the power sum polynomial $\sum_{i=1}^n x_i^n$ over the field of complex numbers. A similar result was claimed in a recent paper of Sheshadri (arXiv:2606.13628), via an AI-assisted and AI-written proof. Assuming its correctness, this was the first...

Mrinal Kumar, Ben Lee Volk · 1 citation
Preprint Sep 2026

A proof of Borcea's quadratic variance conjecture

Let $p$ be a complex polynomial of degree $n\ge2$, and let $\sigma_2(p)$ be the root mean square distance of its zeros from their centroid, including multiplicities. We prove that every zero of $p$ lies within distance $\sigma_2(p)$ of a critical point. This proves Borcea's quadratic conjecture and, in particular, give...

Ludovick Bouthat, Shaun M. Fallat · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.