# Rational and algebraic series in combinatorial enumeration

@inproceedings{BousquetMelou2006RationalAA, title={Rational and algebraic series in combinatorial enumeration}, author={Mireille Bousquet-M'elou}, year={2006} }

Let A be a class of objects, equipped with an integer size such that for all n the
number an of objects of size n is finite. We are interested in the case where the generating
functionn antn is rational, or more generally algebraic. This property has a practical interest,
since one can usually say a lot on the numbers an, but also a combinatorial one: the rational
or algebraic nature of the generating function suggests that the objects have a (possibly hidden)
structure, similar to the linear…

## 54 Citations

### Algebraic Diagonals and Walks

- MathematicsISSAC
- 2015

This study studies algorithmic questions related to diagonals in the case where F is the Taylor expansion of a bivariate rational function, and proposes an algorithm that computes an annihilating polynomial for DiagF, the univariate power series generated by the diagonal terms of F.

### Formulae and Asymptotics for Coefficients of Algebraic Functions

- MathematicsCombinatorics, Probability and Computing
- 2014

When the function is a power series associated to a context-free grammar, the critical exponents α cannot be 1/3 or −5/2; they in fact belong to a proper subset of the dyadic numbers.

### GENERATING SERIES : A COMBINATORIAL COMPUTATION

- Mathematics
- 2012

The purpose of this paper is to apply combinatorial techniques for computing coefficients of rational formal series (Gk) in two noncommuting variables and their differences at orders k and k-1. This…

### Overview of some general results in combinatorial enumeration

- Mathematics
- 2008

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures.
These include…

### Asymptotics of lattice walks via analytic combinatorics in several variables

- MathematicsDiscrete Mathematics & Theoretical Computer Science
- 2020

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…

### Coefficients of algebraic functions: formulae and asymptotics

- Mathematics
- 2013

This paper studies the coefficients of algebraic functions. First, we recall the too-little-known fact that these coefficients $f_n$ have a closed form. Then, we study their asymptotics, known to be…

### Algebraic independence of G-functions and congruences "à la Lucas"

- MathematicsAnnales scientifiques de l'École normale supérieure
- 2019

We develop a new method for proving algebraic independence of $G$-functions. Our approach rests on the following observation: $G$-functions do not always come with a single linear differential…

### Submonoids of the formal power series

- Mathematics
- 2015

Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]]…

### On the growth of permutation classes

- Mathematics, Computer Science
- 2015

It is proved that, asymptotically, patterns in Łukasiewicz paths exhibit a concentrated Gaussian distribution, and a new enumeration technique is introduced, based on associating a graph with each permutation, and the generating functions for some previously unenumerated classes are determined.

### Variants of the Kernel Method for Lattice Path Models

- Mathematics, Computer Science
- 2014

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.

## References

SHOWING 1-10 OF 103 REFERENCES

### Walks on the slit plane

- Mathematics
- 2000

Abstract. In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the half-line . We call them walks on the slit plane. We…

### Walks in the quarter plane: Kreweras’ algebraic model

- Mathematics
- 2004

We consider planar lattice walks that start from (0, 0), remain in the first quadrant i, j ≥ 0, and are made of three types of steps: North-East, West and South. These walks are known to have…

### A Bijective Approach to the Area of Generalized Motzkin Paths

- MathematicsAdv. Appl. Math.
- 2002

The total area under the paths of E"n equals the total number of lattice points on the x-axis hit by the unrestricted paths running from (0-0) to (n-2,0) and using the same step set as above.

### Planar Maps are Well Labeled Trees

- MathematicsCanadian Journal of Mathematics
- 1981

In the theory of enumeration, the part devoted to the counting of planar maps gives rather surprising results. Of special interest to the combinatorialists is the conspicuous feature of counting…

### Lecture Hall Partitions

- Mathematics
- 1997

We prove a nite version of the well-known theorem that says that the number of partitions of an integer N into distinct parts is equal to the number of partitions of N into odd parts. Our version…

### Enumeration of Planar Constellations

- MathematicsAdv. Appl. Math.
- 2000

The enumeration of transitive ordered factorizations of a given permutation is a combinatorial problem related to singularity theory. Let n?1, and let ?0 be a permutation of Sn having di cycles of…

### Random planar lattices and integrated superBrownian excursion

- Computer Science
- 2002

The results suggest the existence of a Continuum Random Map describing in term of ISE the scaled limit of the dynamical triangulations considered in two-dimensional pure quantum gravity.