In your lifetime you won’t encounter neither right choices nor bad choices,
but whenever you have to make one, you’ll have to fight so that it becomes the best decision you could have ever taken.
Ph.D. student in mathematics
My recent articles
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…
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…