Sendov's conjecture

Last updated

In mathematics, Sendov's conjecture, sometimes also called Ilieff's conjecture, concerns the relationship between the locations of roots and critical points of a polynomial function of a complex variable. It is named after Blagovest Sendov.

Contents

The conjecture states that for a polynomial

with all roots r1, ..., rn inside the closed unit disk |z|  1, each of the n roots is at a distance no more than 1 from at least one critical point.

The Gauss–Lucas theorem says that all of the critical points lie within the convex hull of the roots. It follows that the critical points must be within the unit disk, since the roots are.

The conjecture has been proven for n < 9 by Brown-Xiang and for n sufficiently large by Tao. [1] [2]

History

The conjecture was first proposed by Blagovest Sendov in 1959; he described the conjecture to his colleague Nikola Obreshkov. In 1967 the conjecture was misattributed [3] to Ljubomir Iliev by Walter Hayman. [4] In 1969 Meir and Sharma proved the conjecture for polynomials with n < 6. In 1991 Brown proved the conjecture for n < 7. Borcea extended the proof to n < 8 in 1996. Brown and Xiang [5] proved the conjecture for n < 9 in 1999. Terence Tao proved the conjecture for sufficiently large n in 2020.

Related Research Articles

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann.

The fundamental theorem of algebra also known as d'Alembert's theorem or the d'Alembert-Gauss theorem states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero.

In mathematics, the Weil conjectures were highly influential proposals by André Weil (1949). They led to a successful multi-decade program to prove them, in which many leading researchers developed the framework of modern algebraic geometry and number theory.

Analytic number theory Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

In complex analysis, de Branges's theorem, or the Bieberbach conjecture, is a theorem that gives a necessary condition on a holomorphic function in order for it to map the open unit disk of the complex plane injectively to the complex plane. It was posed by Ludwig Bieberbach (1916) and finally proven by Louis de Branges (1985).

Kakeya set

In mathematics, a Kakeya set, or Besicovitch set, is a set of points in Euclidean space which contains a unit line segment in every direction. For instance, a disk of radius 1/2 in the Euclidean plane, or a ball of radius 1/2 in three-dimensional space, forms a Kakeya set. Much of the research in this area has studied the problem of how small such sets can be. Besicovitch showed that there are Besicovitch sets of measure zero.

In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural density contains a k-term arithmetic progression for every k. Endre Szemerédi proved the conjecture in 1975.

In geometric group theory, Gromov's theorem on groups of polynomial growth, first proved by Mikhail Gromov, characterizes finitely generated groups of polynomial growth, as those groups which have nilpotent subgroups of finite index.

Terence Tao Australian-American mathematician

Terence "Terry" Chi-Shen Tao is an Australian-American mathematician. He is a professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins chair. His research includes topics in harmonic analysis, partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and analytic number theory.

Transcendental number theory Study of numbers that are not solutions of polynomials with rational coefficients

Transcendental number theory is a branch of number theory that investigates transcendental numbers, in both qualitative and quantitative ways.

Ben Green (mathematician) British mathematician

Ben Joseph Green FRS is a British mathematician, specialising in combinatorics and number theory. He is the Waynflete Professor of Pure Mathematics at the University of Oxford.

In number theory, the Green–Tao theorem, proved by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for every natural number k, there exist arithmetic progressions of primes with k terms. The proof is an extension of Szemerédi's theorem. The problem can be traced back to investigations of Lagrange and Waring from around 1770.

Riemann hypothesis Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann (1859), after whom it is named.

In mathematics, in the field of additive combinatorics, a Gowers norm or uniformity norm is a class of norms on functions on a finite group or group-like object which quantify the amount of structure present, or conversely, the amount of randomness. They are used in the study of arithmetic progressions in the group. They are named after Timothy Gowers, who introduced it in his work on Szemerédi's theorem.

Julius Borcea Romanian Swedish mathematician

Julius Bogdan Borcea was a Romanian Swedish mathematician. His scientific work included vertex operator algebra and zero distribution of polynomials and entire functions, via correlation inequalities and statistical mechanics.

Alexander Varchenko

Alexander Nikolaevich Varchenko is a Soviet and Russian mathematician working in geometry, topology, combinatorics and mathematical physics.

Tamar Ziegler Israeli mathematician

Tamar Debora Ziegler is an Israeli mathematician known for her work in ergodic theory, combinatorics and number theory. She holds the Henry and Manya Noskwith Chair of Mathematics at the Einstein Institute of Mathematics at the Hebrew University.

Bernstein's theorem is an inequality relating the maximum modulus of a complex polynomial function on the unit disk with the maximum modulus of its derivative on the unit disk. It was proven by Sergei Bernstein while he was working on approximation theory.

Cap set Points with no three in a line

In affine geometry, a cap set is a subset of with no three elements in a line. The cap set problem is the problem of finding the size of the largest possible cap set, as a function of . The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ....

In mathematics, the mean value problem was posed by Stephen Smale in 1981. This problem is still open in full generality. The problem asks:

References

  1. Terence Tao (2020). "Sendov's conjecture for sufficiently high degree polynomials". arXiv: 2012.04125 [math.CV].
  2. Terence Tao (9 December 2020). "Sendov's conjecture for sufficiently high degree polynomials". What's new.
  3. Marden, Morris. Conjectures on the Critical Points of a Polynomial. The American Mathematical Monthly 90 (1983), no. 4, 267-276.
  4. Problem 4.5, W. K. Hayman, Research Problems in Function Theory. Althlone Press, London, 1967.
  5. Brown, Johnny E.; Xiang, Guangping Proof of the Sendov conjecture for polynomials of degree at most eight. Journal of Mathematical Analysis and Applications 232 (1999), no. 2, 272–292.