We introduce an algorithmic approach based on a generating tree method for enumerating
the inversion sequences with various pattern-avoidance restrictions. For a given set of …

Counting quadrant walks via Tutte’s invariant method Page 1 FPSAC 2016 Vancouver, Canada
DMTCS proc. BC, 2016, 203–214 Counting quadrant walks via Tutte’s invariant method Olivier …

We construct a new family of random permutons, called skew Brownian permuton, which
describes the limits of several models of random constrained permutations. This family is …

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint
rectangles, such that no four rectangles meet in a point. In this work we present a versatile …

The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--
Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has …

Inversion sequences have intriguing applications in combinatorics, computer sciences and
polyhedral geometry. Ascent sequences, as one of the most important subsets of inversion …

Inversion sequences are in natural bijection with permutations and have surprising
connections with lecture hall polytopes and partitions. Recently, Martinez and Savage …

The first problem addressed by this article is the enumeration of some families of pattern-
avoiding inversion sequences. We solve some enumerative conjectures left open by the …

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural
equivalence relations, rectangulations can be seen as combinatorial objects with a rich …

We derive the algebraic generating function for inversion sequences avoiding the patterns
$201 $ and $210 $ by describing a set of succession rules, converting them to a system of …