Abstract
This paper extends Flajolet's ( Discrete Math. 32 (1980) , 125–161) combinatorial theory of continued fractions by obtaining the generating function for paths between horizontal lines, with arbitrary starting and ending points 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
