Cycles of free words in several independent random permutations with restricted cycle lengths
Résumé
In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word w in letters g(1),g(1)(-1),..., g(k),g(k)(-1), secondly, for all n, we introduce a k-tuple s(1)(n),..., s(k)(n) of independent random permutations of {1,..., n}, and the random permutation sigma(n) we are going to consider is the one obtained by replacing each letter g(i) in w by s(i)(n). For example, for w = g(1)g(2)g(3)g(2)(-1), sigma(n) = s(1)(n) degrees s(2)(n) degrees s(3)(n) degrees s(2)(n)(-1). Moreover, we restrict the set of possible lengths of the cycles of the s(i)(n)'s: we fix sets A(1),..., A(k) of positive integers and suppose that for all n, for all i, s(i)(n) is uniformly distributed on the set of permutations of {1,..., n} which have all their cycle lengths in A(i). For all positive integers l, we are going to give asymptotics, as n goes to infinity, on the number N(l)(sigma(n)) of cycles of length l of sigma(n). We shall also consider the joint distribution of the random vectors (N(1)(sigma(n)),..., N(l)(sigma(n))). We first prove that the representant of w in a certain quotient of the free group with generators g(1),..., g(k) determines the rate of growth of the random variables N(l)(sigma(n)) as n goes to infinity. We also prove that in many cases, the distribution of N(l)(sigma(n)) converges to a Poisson law with parameter 1/l and that the random variables N(1)(sigma(n)), N(2)(sigma(n)),... are asymptotically independent. We notice the surprising fact that from this point of view, many things happen as if sigma(n) were uniformly distributed on the n-th symmetric group.