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 …

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically
and rigorously study the structure of combinatorial objects and derive their counting …

We establish a phase transition for permutation classes (downsets of permutations under the
permutation containment order): there is an algebraic number κ, approximately 2.20557, for …

We investigate a generalization of stacks that we call C-machines. We show how this
viewpoint rapidly leads to functional equations for the classes of permutations that C …

Zeilberger's enumeration schemes can be used to completely automate the enumeration of
many permutation classes. We extend his enumeration schemes so that they apply to many …

We describe a practical algorithm which computes the accepting automaton for the insertion
encoding of a permutation class, whenever this insertion encoding forms a regular …

We introduce operators $\mathsf {hare} $ and $\mathsf {tortoise} $, which act on words as
natural generalizations of West's stack-sorting map. We show that the heuristically slower …

Wilf classification of triples of 4-letter patterns II Page 1 Discrete Mathematics and Theoretical
Computer Science DMTCS vol. 19:1, 2017, #6 Wilf classification of triples of 4-letter patterns II …

arXiv:1209.0425v1 [math.CO] 3 Sep 2012 Page 1 arXiv:1209.0425v1 [math.CO] 3 Sep 2012
INFLATIONS OF GEOMETRIC GRID CLASSES: THREE CASE STUDIES Michael H. Albert …

Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+ 2)-
avoiding posets and their pattern avoidance properties were first considered by Duncan and …