arXiv (All)
open access
A Scalar Optimization Proof of Sendov's Conjecture with Reduced Computer Assistance
Let $p$ be a complex polynomial of degree $n\ge2$ whose zeros lie in the closed unit disk. Sendov's conjecture asserts that every zero of $p$ lies within distance one of a zero of $p'$. Mazur's recent proof, and Tao's streamlined exposition of it, reduce a hypothetical counterexample to a scalar low
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sendov's conjecture holds for every degree $n\ge 10^{200000}$#1034024
- A Short Proof of a Conjecture Regarding Quadratic Representations of Practical Numbers#1123195
- On a uniform bound for exponential sums modulo $p^m$ for Deligne polynomials#1129024
- A Short Proof of a Theorem of Pan and Zhang#1141830
- Lower bounds for discrete moments in a conjecture of Ng#1062928
Record · ID 927547
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive