We consider two orthogonal points of view on finite permutations, seen as pairs of linear
orders (corresponding to the usual one line representation of permutations as words) or …

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 …

Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It
finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to …

We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main
technique consists in using Stanley's standardization to obtain a transport theorem between …

In 2011, Duncan and Steingr\'imsson conjectured that modified ascent sequences avoiding
any of the patterns 212, 1212, 2132, 2213, 2231 and 2321 are counted by the Bell numbers …

If your socks come out of the laundry all mixed up, how should you sort them? We introduce
and study a novel foot-sorting algorithm that uses feet to attempt to sort a sock ordering; one …

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 …

We undertake a detailed investigation into the structure of permutations in monotone grid
classes whose row-column graphs do not contain components with more than one cycle …

A Cayley permutation is a word of positive integers such that if a letter appears in this word,
then all positive integers smaller than that letter also appear. We initiate a systematic study …

Pin permutations play an important role in the structural study of permutation classes, most
notably in relation to simple permutations and well-quasi-ordering, and in enumerative …