Longest increasing subsequences of random colored permutations

Details Longest increasing subsequences of random colored permutations Longest increasing subsequences of random colored permutations

1999-01-31

arxiv.org/abs/math/9902001v2

Mathematics

Combinatorics

AMSTeX, 11 pages

Scientific paper

We compute the limit distribution for (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 two--colored case our method provides a different proof of a similar result by Tracy and Widom about 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.

Affiliated with

Also associated with

No associations

Rating

Longest increasing subsequences of random colored permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Longest increasing subsequences of random colored permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest increasing subsequences of random colored permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178633