Longest Increasing Subsequences of Random Colored Permutations
Keyword(s):
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.
Keyword(s):
1977 ◽
Vol 14
(02)
◽
pp. 387-390
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 08
(06)
◽
pp. 1541-1556
◽
2015 ◽
Vol 68
◽
pp. 18-50
◽
1959 ◽
Vol 55
(4)
◽
pp. 328-332
◽