A Proof of Sendov’s Conjecture

نویسنده

  • GERALD SCHMIEDER
چکیده

The zeros of the derivative of a complex polynomial p are functions of the zeros of p itself. In general we do not know explicit expressions for these functions. So approximate localizations of the derivative zeros in terms of the given zeros of p are of interest. A question of this type is the famous conjecture of Bl. Sendov which goes back to 1959 and took place in Hayman’s booklet on problems in Complex Analysis (1967, [2], by a misunderstanding, there it was named after Ilieff). It has been one of the most important problems in the zone between Function Theory and Algebraic Geometry in the least 40 years. This conjecture states: Let p ∈ C [z] be a polynomial of degree n > 1 having all zeros z1, . . . , zn in the closed unit disk E. Does there exist for every zj some ζ with |zj − ζ | ≤ 1 and p (ζ) = 0 ? For a history of the conjecture and a list of the numerous (about 100) publications on it, most of them in famous international journals, see the recent article of Bl. Sendov [9] or the survey of Schmeisser [8]. In this paper we give a proof of this question. By Pn we denote the class of all monic polynomials of degree n > 1 having all its zeros in E. For the following we fix some polynomial p ∈ Pn with the factorization

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proof of Smale’s Conjecture

Here a proof will be given by a variational method which already has been used to prove Sendov’s conjecture (s. [2]). Let n > 1 be fixed and define Fn as the class of nth degree monic complex polynomials p with p(0) = 0, p(0) 6= 0 and p(ζ) 6= 0 for all derivative zeros ζ of p. Obviously it suffices to consider polynomials p ∈ Fn in order to give a proof of Smale’s conjecture. For such p we defi...

متن کامل

A Proof of Smale’s Mean Value Conjecture

≤ n− 1 n . Equality only occurs for p(z) = a1z + anz n with arbitrary a1, an ∈ C \ {0}. Here a proof will be given by a variational method which recently has been used in a similar way to prove Sendov’s conjecture (s. [2]). Former results and the backgrounds of both conjectures can be found in the survey article of Schmeisser [4]. Let n > 1 be fixed and define Fn as the class of nth degree moni...

متن کامل

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

The Best Possible Quadratic Refinement of Sendov’s Conjecture

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if β is one of those roots, then within one unit of β lies a root of the polynomial’s derivative. If we define r(β) to be the greatest possible distance between β and the closest root of the derivative, then Sendov’s conjecture claims that r(β) ≤ 1. In this paper, we assume (without loss of generality) tha...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002