Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality (Q2369904)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality |
scientific article |
Statements
Bieberbach's conjecture, the de Branges and Weinstein functions and the Askey-Gasper inequality (English)
0 references
21 June 2007
0 references
This paper gives an excellent description of the history of the Bieberbach conjecture, covering the period from its conception in 1916 [\textit{L. Bieberbach, S.-B. Preuss. Akad. Wiss. 38, 940--955 (1916; JFM 46.0552.01)] to its final proof in 1984 [\textit{L. de Branges}, Acta Math. 154, 137--152 (1985; Zbl 0573.30014)] and a subsequent proof in 1991 [\textit{L. Weinstein}, Int. Math. Res. Notices 5, 61--64 (1991; Zbl 0743.30021)]. This 27 page paper (including a list of 75 references) touches upon each historically important step of the nearly 70 years between Bieberbach and de Branges and reads like a `hard-to-put-down detective story'. Discussing the contributions by Loewner, Nevanlinna, Littlewood, Dieudonné, Rogosinski, Paley, Robertson, Schiffer, Grunsky, Hyman, Reade, Garabedian, Schiffer, Charzyński, the story finally reaches Milin and Lebedev and their famous conjecture. Proving this conjecture, de Branges succeeded to prove both the Robertson and Bieberbach conjectures in 1984. At that time a result on special functions that `was on the shelf' [\textit{R. Askey, G. Gaspar}, Am. J. Math. 98, 709--737 (1976; Zbl 0355.33005)] suddenly played the role of the missing link! The final touch in the application of the Askey-Gaspar identity (representing the de Branges function as a linear combination of \({}_3F_2\) hypergeometric functions) and the Askey-Gaspar inequality (asserting that each of the \({}_3F_2\)'s was non-negative) was actually Clausen's identity, expressing the \({}_3F_2\) as the square of a \({}_2F_1\). Moreover, the paper covers the application of computer algebra (specifically Zeilberger's algorithm) in automated proofs and also gives an extensive description of the proof of the Bieberbach conjecture by Leonard Weinstein in 1991 (cited above), a proof that circumvents the use of the Askey-Gaspar inequality. The author is to be commended for this lucid description of the history and proof of one of the famous conjectures in mathematics.}
0 references
univalent functions
0 references
Bieberbach conjecture
0 references
Robertson conjecture
0 references
Milin conjecture
0 references
convex functions
0 references
close-to-convex functions
0 references
Grunsky inequalities
0 references
Shiffer variation
0 references
support points
0 references
extreme points
0 references
Loewner differential equation
0 references
Loewner theory
0 references
Lebedev-Milin inequalities
0 references
de Branges theorem
0 references
de Branges functions
0 references
Weinstein functions
0 references
hypergeometric functions
0 references
generalized hypergeometric series
0 references
Askey-Gaspar inequality
0 references
Askey-Gaspar identity
0 references
Legendre addition theorem
0 references
FPS algorithm
0 references
Zeilberger algorithm
0 references
Maple
0 references
symbolic computation
0 references
computer algebra
0 references