Preprints

A decorated tree approach to random permutations in substitution-closed classes (with Mathilde Bouvel, Valentin Féray, and Benedikt Stufler)

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a criticality constraint. It also enables us to reprove and strengthen permuton limits for these classes in a new way, that uses a semi-local …

A decorated tree approach to random permutations in substitution-closed classes (with Mathilde Bouvel, Valentin Féray, and Benedikt Stufler)Read More »

Square permutations are tipically rectangular (with Erik Slivken)

ArXiv A three-pages abstract for Permutation Patterns 2019 We can think of the records of a permutation (i.e., left-to-right or right-to-left maxima or minima) as the external points of a permutation. The points of a permutation that do not correspond to records are called internal points.  Square permutations are permutations with no internal points. Here …

Square permutations are tipically rectangular (with Erik Slivken)Read More »