activity
20002020
most cited(2+2)-free posets, ascent sequences and pattern avoiding permutations

139 citations · 656 across the 26 of their papers we have counts for

collaborators

31 papers

math.CO2020

Counting planar maps, coloured or uncoloured

Mireille Bousquet-Mélou

We present recent results on the enumeration of -coloured planar maps, where each monochromatic edge carries a weight . This is equivalent to weighting each map by its Tutte…

math.CO2017

Counting Walks in the Quarter Plane

Mireille Bousquet-Melou

We study planar walks that start from a given point (i\_0, j\_0), take their steps in a finite set S, and are confined in the first quadrant of the plane. Their enumeration can be…

math.CO2016★ 7 cited

On the number of planar Eulerian orientations

Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec +1

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears…

math.CO2015★ 26 cited

Square lattice walks avoiding a quadrant

Mireille Bousquet-Mélou

In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks i…

math.CO2015

Counting coloured planar maps: differential equations

Olivier Bernardi, Mireille Bousquet-Mélou

We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differ…

math.CO2014★ 43 cited

On 3-dimensional lattice walks confined to the positive octant

Alin Bostan, Mireille Bousquet-Mélou, Manuel Kauers +1

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps…