Longest increasing subsequences of random colored permutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
AMSTeX, 11 pages

Keywords

Combinatorics, Probability, 05A05; 60F99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/78028

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9902001
 http://arxiv.org/abs/math/9902001

Collections

arXiv