Multiplicity of zeros and discrete orthogonal polynomials

被引:0
作者
Krasikov I. [1 ]
机构
[1] Department of Mathematical Sciences, Brunei University, Uxbridge
关键词
Classical Orthogonal Polynomial; Distance Distribution; Laguerre Polynomial; Orthogonal Polynomial; Prescribe Norm;
D O I
10.1007/BF03322997
中图分类号
学科分类号
摘要
We consider a problem of bounding the maximal possible multiplicity of a zero of some expansions Σ aiFi(x), at a certain point c, depending on the chosen family {imi}. The most important example is a polynomial with c = 1. It is shown that this question naturally leads to discrete orthogonal polynomials. Using this connection we derive some new bounds, in particular on the multiplicity of the zero at one of a polynomial with a prescribed norm. 30C15, 33C47 © 2004, Birkhäuser Verlag, Basel.
引用
收藏
页码:59 / 66
页数:7
相关论文
共 13 条
[1]  
Ashikhman A., Barg A., S. Litsyn, Estimates of the distance distribution of codes and designs, IEEE Trans. Inf. Theory 47, 3, pp. 1050-1061, (2001)
[2]  
Bloch A., Polya G., On the roots of certain algebraic equations, Proc. London Math. Soc., 33, pp. 102-114, (1932)
[3]  
Boyd D.W., On a problem of Byrnes concerning polynomials with restricted coefficients, Math. Comp., 66, pp. 1697-1703, (1997)
[4]  
Erdos P., Turan P., On distribution of roots of polynomials, Annals of Math., 51, pp. 105-119, (1950)
[5]  
Borwein P., Erdelyi T., Polynomials and Polynomial Inequalities, (1995)
[6]  
Borwein P., Erdelyi T., On the zeros of polynomials with restricted coefficients, Illinois J. Math., 41, pp. 667-675, (1997)
[7]  
Borwein P., Erdelyi T., Kos G., Littlewood-type problems on [0,1], Proc. London Math. Soc., pp. 22-46, (1999)
[8]  
Erdelyi T., Polynomials with Littlewood-Type Coefficient Constrains, Approximation Theory X: Abstract and Classical Analysis
[9]  
Foster W.H., Krasikov I., An Improvement of a Borwein- Erdélyi- Kós Result, Methods and Applications of Analysis, 7, pp. 605-614, (2000)
[10]  
MacWilliams F.J., Sloane N.J.A., The Theory of Error-Correcting Codes, (1977)