Combinatorial aspects of continued fractions

@article{Flajolet1980CombinatorialAO,
  title={Combinatorial aspects of continued fractions},
  author={Philippe Flajolet},
  journal={Discret. Math.},
  year={1980},
  volume={306},
  pages={992-1021}
}

SOME MULTIVARIATE POLYNOMIALS FOR DOUBLED PERMUTATIONS

. Flajolet and Fran¸con [European. J. Combin. 10 (1989) 235-241] gave a combinatorial interpretation for the Taylor coefficients of the Jacobian elliptic functions in terms of doubled permutations. We

SOME MULTIVARIATE POLYNOMIALS FOR DOUBLED PERMUTATIONS

Flajolet and Françon [European. J. Combin. 10 (1989) 235-241] gave a combinatorial interpretation for the Taylor coefficients of the Jacobian elliptic functions in terms of doubled permutations. We

Un autre q-analogue des nombres d’Euler

The ordinary generating functions of the secant and tangent numbers have very simple continued fraction expansions. However, the classical q-secant and q-tangent numbers do not give a natural

The trace method for cotangent sums

Hurwitzian Continued Fractions Containing a Repeated Constant and An Arithmetic Progression

  • G. Hetyei
  • Mathematics
    SIAM J. Discret. Math.
  • 2014
We prove an explicit formula for infinitely many convergents of Hurwitzian continued fractions that repeat several copies of the same constant and elements of one arithmetic progression, in a

A q-enumeration of alternating permutations

The q-tangent and q-secant numbers via continued fractions

...

Introduction to Combinatorial Analysis

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent

Functional composition patterns and power series reversion

found in the writings of Jacobson [9], Becker [2], Motzkin [11], and Bourbaki [3; 4]. This paper will be concerned with a natural generalization of Cayley's problem, and will show that the solution

A Course of Modern Analysis

The volume now gives a somewhat exhaustive account of the various ramifications of the subject, which are set out in an attractive manner and should become indispensable, not only as a textbook for advanced students, but as a work of reference to those whose aim is to extend the knowledge of analysis.

Towards analysing sequences of operations for dynamic data structures

This paper presents the average case performance analysis of dynamic data structures subjected to arbitrary sequences of insert, delete and query operations and uses the result to explicitly compute integrated costs of various efficient data structure implementations.