Borodin, Alexei (1999) Longest Increasing Subsequences of Random Colored Permutations. Electronic Journal of Combinatorics, 6 (R13). ISSN 1077-8926 http://resolver.caltech.edu/CaltechAUTHORS:BORejc99
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:BORejc99
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.
|Additional Information:||Submitted: February 7, 1999; Accepted: February 15, 1999. I am very grateful to G. I. Olshanski for a number of valuable discussions.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||12 Apr 2006|
|Last Modified:||26 Dec 2012 08:50|
Repository Staff Only: item control page