A combinatorial interpretation of the quotient-difference algorithm

From MaRDI portal





The author gives the condensed revue of his own combinatorial theory of orthogonal polynomials, Hankel determinants, continued fractions and Padé approximants. The \(qd\)-algorithm is viewed, for instance, as an algorithm for computing the expansion into a Stieltjes continued fraction of a given generating power series. The author studies in details the combinatorial interpretation of this algorithm by means of the weighted Motzkin paths. The configurations of the particular Motzkin paths, the so-called Dyck paths, allow to interpretate Hankel determinants. An exhaustive list of 26 references is presented. For the entire collection see [Zbl 0941.00013].











This page was built for publication: A combinatorial interpretation of the quotient-difference algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502552)