There has been considerable interest recently in the subject of patterns in permutations and
words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and …

A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel
Research Directions Focusing on a very active area of research in the last decade …

This book gives an introduction to and an overview of the methods used in the combinatorics
of pattern avoidance and pattern enumeration in set partitions, a very active area of research …

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 …

An inversion sequence of length $ n $ is a sequence of integers $ e= e_1\cdots e_n $ which
satisfies for each $ i\in [n]=\{1, 2,\ldots, n\} $ the inequality $0\le e_i< i $. For a set of patterns …

Extending the notion of pattern avoidance in permutations, we study matchings and set
partitions whose arc diagram representation avoids a given configuration of three arcs …

This paper continues the analysis of the pattern-avoiding sorting machines recently
introduced by Cerbai, Claesson and Ferrari [CCF]. These devices consist of two stacks …

We take the first steps in developing a theory of transport of patterns from Fishburn
permutations to (modified) ascent sequences. Given a set of pattern avoiding Fishburn …

A restricted growth function (RGF) of length n is a sequence w= w 1 w 2… wn of positive
integers such that w 1= 1 and wi≤ 1+ max⁡{w 1,…, wi− 1} for i≥ 2. RGFs are of interest …

An ascent sequence is a sequence consisting of non-negative integers in which the size of
each letter is restricted by the number of ascents preceding it in the sequence. Ascent …