Power series, Bieberbach conjecture and the de Branges and Weinstein functions

ABSTRACT

It is well-known that de Branges' original proof of the Bieberbach and Milin conjectures on the coefficients $a_n$ of univalent functions $f(z)=Σk=1^infty a_nz^n$ of the unit disk as well as Weinstein's later proof deal with the same special function system that de Branges had introduced in his work.These hypergeometric polynomials had been already studied by Askey and Gasper who had realized their positiveness. This fact was the essential tool in de Branges' proof.In this article, we show that many identities, e.g. the representation of their generating function w.r.t. $n$, for these polynomials, which are intimately related to the Koebe function $K(z)=Σk=1^infty αz^n$ and therefore to univalent functions, can be automatically detected from power series computations by a method developed by the author and accessible in several computer algebra systems.In other words, in this paper a new and interesting application of the FPS (Formal Power Series) algorithm is given. As working engine we use a Maple implementation by Dominik Gruntz and the author. In particular, the hypergeometric representation of both the de Branges and the mboxWeinstein functions are determined by successive power series computations from their generating functions.The new idea behind this algorithm is the observation that hypergeometric function coefficients of double series can be automatically detected by an iteration of the FPS procedure.In a final section we show how algebraic computation enables the fast verification of Askey-Gasper's positivity results for specific (not too large) $n$ using Sturm sequences or similar approaches.

REFERENCES

• 1: Askey, R. and Gasper, G.: Positive Jacobi polynomial sums II. Amer. J. Math. 98, 1976, 709--737.
• 2: Bieberbach, L.: Über die Koeffizienten derjenigen Potenzreihen, welche eine schlichte Abbildung des Einheitskreises vermitteln. Semesterberichte Preuss. Akad. Wiss. 38, 1916, 940--955.
• 3: De Branges, L.: A proof of the Bieberbach conjecture. Acta Math. 154, 1985, 137--152.
• 4: George E. Collins , Werner Krandick, An efficient algorithm for infallible polynomial complex root isolation, Papers from the international symposium on Symbolic and algebraic computation, p.189-194, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143308]
• 5: Ekhad, S. B. and Zeilberger, D.: A high school algebra, "formal calculus", proof of the Bieberbach conjecture {after L. Weinstein}. Jerusalem Combinatorics'93, Contemp. Math. 178, Amer. Math. Soc., Providence, 1994, 113--115. Review in Zentralblatt für Mathematik 0894.30013,
• 6: Gruntz, D. and Koepf, W.: Maple package on formal power series. Maple Technical Newsletter 2 (2), 1995, 22--28.
• 7: Gruntz, D., Koepf, W. and Müller, D.: FPS.mpl for Maple 8, http:/www.mathematik.uni-kassel.de/˜koepf/Publikationen, 2002.
• 8: Wolfram Koepf, Power series in computer algebra, Journal of Symbolic Computation, v.13 n.6, p.581-603, June 1992
• 9: Wolfram Koepf, Algorithms for m-fold hypergeometric summation, Journal of Symbolic Computation, v.20 n.4, p.399-417, October 1995 [doi>10.1006/jsco.1995.1056]
• 10: Koepf, W.: Hypergeometric Summation. Vieweg, Braunschweig/Wiesbaden, 1998.
• 11: Koepf, W. and Schmersau, D.: On the de Branges Theorem. Complex Variables 31, 1996, 213--230.
• 12: Koepf, W. and Schmersau, D.: Weinstein's functions and the Askey-Gasper identity. Integral Transforms and Special Functions 5, 1997, 227--246.
• 13: Lebedev, N. A. and Milin, I. M.: An inequality. Vestnik Leningrad Univ. 20, 1965, 157--158 (Russian).
• 14: Löwner, K.: Untersuchungen über schlichte konforme Abbildungen des Einheitskreises I. Math. Ann. 89, 1923, 103--121.
• 15: Todorov, P.: A simple proof of the Bieberbach conjecture. Bull. Cl. Sci., VI. S'er., Acad. R. Belg. 3 (12), 1992, 335--346.
• 16: Weinstein, L.: International Mathematics Research Notices 5, 1991, 61--64.
• 17: Wilf, H.: A footnote on two proofs of the Bieberbach-de Branges Theorem. Bull. London Math. Soc. 26, 1994, 61--63.
• 18: Wilf, H. and Zeilberger, D.: An algorithmic proof theory for hypergeometric (ordinary and "$q$") multisum/integral identities. Invent. Math. bf 103, 1992, 575--633.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Recurrences and difference equations; Generating functions

General Terms:
Algorithms

Keywords:
Askey-Gasper inequality, Bieberbach conjecture, FPS algorithm, Sturm sequences, Weinstein functions, algorithmic computation of formal power series, de Branges functions