pith. sign in

arxiv: 0710.2134 · v1 · submitted 2007-10-10 · 🧮 math.CA · cs.IT· math-ph· math.IT· math.MP

Discrete entropies of orthogonal polynomials

classification 🧮 math.CA cs.ITmath-phmath.ITmath.MP
keywords lambdamathcaldiscretepolynomialsbehaviorbesidescasechebyshev
0
0 comments X
read the original abstract

Let $p_n$ be the $n$-th orthonormal polynomial on the real line, whose zeros are $\lambda_j^{(n)}$, $j=1, ..., n$. Then for each $j=1, ..., n$, $$ \vec \Psi_j^2 = (\Psi_{1j}^2, ..., \Psi_{nj}^2) $$ with $$ \Psi_{ij}^2= p_{i-1}^2 (\lambda_j^{(n)}) (\sum_{k=0}^{n-1} p_k^2(\lambda_j^{(n)}))^{-1}, \quad i=1, >..., n, $$ defines a discrete probability distribution. The Shannon entropy of the sequence $\{p_n\}$ is consequently defined as $$ \mathcal S_{n,j} = -\sum_{i=1}^n \Psi_{ij}^{2} \log (\Psi_{ij}^{2}) . $$ In the case of Chebyshev polynomials of the first and second kinds an explicit and closed formula for $\mathcal S_{n,j}$ is obtained, revealing interesting connections with the number theory. Besides, several results of numerical computations exemplifying the behavior of $\mathcal S_{n,j}$ for other families are also presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.