×

Multiplicity of zeros and discrete orthogonal polynomials. (English) Zbl 1052.30012

A sequence of functions \(F_0(z),F_1(z),\dots,F_n(z)\) analytic in an open disc centered at \(c\) is called a \(\Delta(n,c)\) basis if there are \(n+1\) polynomials \(R_0(x),R_1(x),\dots,R_n(x)\) such that (i) the derivatives satisfy \(F_i^{(j)}(c)=R_j(i)\), \(i,j=0,1,\ldots,n\), and (ii) the polynomials \(R_i(x)\) form a basis of \(\mathcal P^n\). One of the main results of this paper states the following: if \(p(x)=\sum_{i=0}^n a_iF_i(x)\) where \(\{F_i(x)\}\) is a \(\Delta(n,c)\) basis, and if the multiplicity \(\mu\) of the zero \(c\) of \(p\) is at least one, then \[ \sum_{i=0}^n | a_i| ^2 \geq \frac{(n-\mu)!(n+\mu)!}{n!^2}| a_0| ^2 \geq e^{2\mu^2/(2n+1)}| a_0| ^2. \] Other inequalities of similar flavor are proved: they all more or less follow from a general theorem involving orthogonal families of polynomials, and specializing this theorem to some given family.

MSC:

30C15 Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
33C47 Other special orthogonal polynomials and functions

References:

[1] A. Ashikhman, A. Barg, S. Litsyn, Estimates of the distance distribution of codes and designs, IEEE Trans. Inf. Theory 47, 3 (2001), 1050–1061. · Zbl 1001.94052
[2] A. Bloch, G. Polya, On the roots of certain algebraic equations, Proc. London Math. Soc. 33 (1932), 102–114. · Zbl 0003.10501 · doi:10.1112/plms/s2-33.1.102
[3] D.W. Boyd, On a problem of Byrnes concerning polynomials with restricted coefficients, Math. Comp. 66 (1997), 1697–1703. · Zbl 0893.12004 · doi:10.1090/S0025-5718-97-00892-2
[4] P. Erdos, P. Turan, On distribution of roots of polynomials, Annals of Math. 51, 1950, 105–119. · Zbl 0036.01501 · doi:10.2307/1969500
[5] P. Borwein, T. Erdélyi, Polynomials and Polynomial Inequalities, Springen-Verlag, 1995.
[6] P. Borwein, T. Erdélyi, On the zeros of polynomials with restricted coefficients, Illinois J. Math. 41 (1997), 667–675. · Zbl 0906.30005
[7] P. Borwein, T. Erdélyi, and G. Kós, Littlewood-type problems on [0,1], Proc. London Math. Soc. (1999) 22-46.
[8] T. Erdélyi, Polynomials with Littlewood-type coefficient constrains, Approximation Theory X: Abstract and Classical Analysis, C.K. Chui, L.L. Schumaker, J. Stöckler (eds), Vanderbilt University Press, Nashville.
[9] W.H. Foster and I. Krasikov, An Improvement of a Borwein- Erdélyi- Kós Result, Methods and Applications of Analysis, Vol.7 4 (2000) 605–614. · Zbl 1009.41005
[10] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, New York: North-Holland, 1977. · Zbl 0369.94008
[11] A. F. Nikiforov, S. K. Suslov and V. B. Uvarov, Classical Orthogonal Polynomials of a Discrete Variable, Nauka, Moscow 1985; English transl., Springer-Verlag, Berlin 1991. · Zbl 0642.33020
[12] I. Schur, Untersuchungen über algebraische Gleichungen., Sitz. Preuss. Akad. Wiss., Phys-Math. Kl, 1933, 404-428.
[13] G. Szegö, Orthogonal Polynomials, Amer. Math. Soc. Colloq. Publ., v.23, Providence, RI, 1975.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.