10 citations · 13 across the 6 of their papers we have counts for
8 papers
Permutations, Pattern Covers, Posets and Positivity, Part II: Regular Pattern Packings and Moment Sequences
Natasha Blitvić, Mohammed Slim Kammoun, Einar Steingrímsson
We prove that broad families of regular pattern packings are enumerated by moments of probability measures on . A packing prescribes occurrences of a consecutive permut…
Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations
Thomas Budzinski, Victor Dubach, Valentin Féray +2
We study Mallows random permutations conditioned to avoid a given pattern of length~. When the bias parameter is of the form , we prove that these permutations conv…
Asymptotic normality of pattern counts in conjugacy classes
Valentin Féray, Mohamed Slim Kammoun
We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy clas…
A note on monotone subsequences and the RS image of invariant random permutations with macroscopic number of fixed points
Mohamed Slim Kammoun
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel meas…
Universality for random permutations and some other groups
Mohamed Slim Kammoun
We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020]…
A product of invariant random permutations has the same small cycle structure as uniform
Mohamed Slim Kammoun, Mylène Maïda
We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of le…
On the longest common subsequence of independent random permutations invariant under conjugation
Mohamed Slim Kammoun
Bukh and Zhou conjectured that the expectation of the length of the longest common subsequence of two i.i.d random permutations of size is greater than . We prove in…
Monotonous subsequences and the descent process of invariant random permutations
Mohamed Slim Kammoun
It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper,…