Path generating functions and continued fractions (Q1072555): Difference between revisions

From the authors' abstract: ``This paper extends \textit{P. Flajolet}'s [Discrete Math. 32, 125--161 (1980; Zbl 0445.05014)] combinatorial theory of continued fractions by obtaining the generating function for paths between horizontal lines, with arbitrary starting and ending point and weights on the steps. Consequences of the combinatorial arguments used to determine this result are combinatorial proofs for many classical identities involving continued fractions and their convergents, truncations, numerator and denominator polynomials.''