Basic analytic combinatorics of directed lattice paths

  title={Basic analytic combinatorics of directed lattice paths},
  author={Cyril Banderier and Philippe Flajolet},
  journal={Theor. Comput. Sci.},

Figures from this paper

Variants of the Kernel Method for Lattice Path Models

The iterated kernel method is applied to determine asymptotic information about a family of models in the quarter plane, finding their generating functions explicitly and classifying them as non D-finite.

Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area †

This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on N, with a finite set of jumps). It is a nice surprise (obtained via the “kernel method”) that the

Analytic Combinatorics of Lattice Paths : Enumeration and Asymptotics for the Average Area †

This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on N, with a finite set of jumps). It is a nice surprise (obtained via the “kernel method”) that the

Lattice paths and random walks

Lattice paths are ubiquitous in combinatorics and algorithmics, where they are either studied per se, or as a convenient encoding of other structures. Logically, they play an important role in

Asymptotics of lattice walks via analytic combinatorics in several variables

International audience We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79

Lattice paths below a line of rational slope

The approach is extended to the case of generating functions involving several dominant singularities, and has applications to a full class of problems involving some "periodicities", and a key ingredient in the proof is the generalization of an old trick by Knuth himself (for enumerating permutations sortable by a stack).

Computer Algebra in the Service of Enumerative Combinatorics

An overview of recent results on structural properties and explicit formulas for generating functions of walks with small steps in the quarter plane are given, especially two important paradigms: "guess-and-prove" and "creative telescoping".

Classifying lattice walks restricted to the quarter plane

  • M. Mishna
  • Mathematics
    J. Comb. Theory, Ser. A
  • 2009

Generating Functions of Embedded Trees and Lattice Paths

The aim of this note is to apply the Bouttier, Di Francesco and Guitter method, consisting of a suitable ansatz and (computer assisted) guessing, to three problems, all related to the enumeration of lattice paths, to derive the generating function of a family of embedded binary trees.



Underdiagonal Lattice Paths with Unrestricted Steps

The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions

Classic works of Karlin and McGregor and Jones and Magnus have established a general correspondence between continuous-time birth-and-death processes and continued fractions of the Stieltjes-Jacobi

A Factorization for Formal Laurent Series and Lattice Path Enumeration

  • I. Gessel
  • Mathematics
    J. Comb. Theory, Ser. A
  • 1980

Combinatorial aspects of continued fractions

Random maps, coalescing saddles, singularity analysis, and Airy phenomena

A class of “universal” phenomena that are of the exponential-cubic type, corresponding to distributions that involve the Airy function are exhibited, related to the coalescence of saddle points and the confluence of singularities of generating functions.

Algebraic geometry for scientists and engineers

Rational and polynomial parametrizations Fractional linear transformations Cubic curves Cubic surfaces and general hypersurfaces Outline of the theory of plane curves Affine plane and projective

Generalized Dyck paths

Singularity Analysis of Generating Functions

This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic