Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 15, 1999 | public
Journal Article Open

Longest Increasing Subsequences of Random Colored Permutations

Abstract

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.

Files

BORejc99.pdf
Files (269.0 kB)
Name Size Download all
md5:f6b5e61b9679b328d6dec00e1366453f
269.0 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 13, 2023