2000 character limit reached
The inverse problem for linearly related orthogonal polynomials: General case
Published 3 Oct 2018 in math.CA | (1810.01691v1)
Abstract: We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum{i=1}N r_{i,n}P_{n-i}(x)=Q_n(x)+\sum_{i=1}M s_{i,n}Q_{n-i}(x)$$ for all $n=0,1, \dots$ where $N$ and $M$ are arbitrary nonnegative integer numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.