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
I am working at the Institut für Mathematik of the Universität Zürich and I am a member of the Zurich Graduate School in Mathematics.
I am mainly interested in Probability theory. I am studying local and scaling limits for random permutations.
My supervisors are Valentin Féray and Mathilde Bouvel.
My recent articles
Almost square permutations are typically square (with Enrica Duchi and Erik Slivken)
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the…
The feasible region for consecutive patterns of permutations is a cycle polytope (with Raul Penaguiao)
We denote the proportion of consecutive patterns in a permutation as We consider the consecutive pattern limiting sets, called the feasible region for consecutive patterns, defined for every We…
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…
Square permutations are typically rectangular (with Erik Slivken)
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…