Stieltjes- and Geronimus-type polynomials (Q1095289)

The paper deals with formal approximation and orthogonality. Starting with the n-th degree orthogonal polynomial w.r.t. a functional c (i.e. \(c(P_ n(x)x^ i)=0\), \(0\leq i\leq n-1\); \(c(x^ i)=c_ i)\) first a generalisation of so-called Stieltjes-type polynomials \(E_ n\) monic, degree \(n+1\), satisfying \[ c(E_{n+1}(x)P_ n(x)x^ i)=0,\quad 0\leq i\leq n \] is constructed and an integral representation and a determinantal formula are given; finally these polynomials are proved to be connected with the error between \(f(t)=\sum c_ it^ i\) and its [n- 1/n] Padé approximant. Furthermore Geronimus-type polynomials \(S_ n\) are defined (using the \(E_{n+1}\) and a - maybe new - functional c') and some representations are given. The last part of the paper gives a proof of the non-existence of a three term recurrence relation for the \(S_ n\) and treats some particular cases. The misprints are easily corrected by the reader who should keep in mind that throughout the entire paper the notation with capital \(P_ n\) is used for the orthogonal polynomial (of degree n) w.r.t. the starting functional c.