Longest increasing subsequences of random colored permutations
The electronic journal of combinatorics, Tome 6 (1999)
We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In the two–colored case our method provides a different proof of a similar result by Tracy and Widom about the longest increasing subsequences of signed permutations (math.CO/9811154). Our main idea is to reduce the 'colored' problem to the case of usual random permutations using certain combinatorial results and elementary probabilistic arguments.
DOI :
10.37236/1445
Classification :
05A05, 60F99, 60C05
Mots-clés : random permutation, increasing subsequence, limit distribution
Mots-clés : random permutation, increasing subsequence, limit distribution
@article{10_37236_1445,
author = {Alexei Borodin},
title = {Longest increasing subsequences of random colored permutations},
journal = {The electronic journal of combinatorics},
year = {1999},
volume = {6},
doi = {10.37236/1445},
zbl = {0923.05001},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1445/}
}
Alexei Borodin. Longest increasing subsequences of random colored permutations. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1445
Cité par Sources :