Longest increasing subsequences of random colored permutations
| dc.creator | Borodin, Alexei | |
| dc.date | 1999-01-31 | |
| dc.date | 1999-02-02 | |
| dc.date.accessioned | 2026-07-07T05:27:43Z | |
| dc.date.available | 2026-07-07T05:27:43Z | |
| dc.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. | |
| dc.description | AMSTeX, 11 pages | |
| dc.identifier | https://arxiv.org/abs/math/9902001 | |
| dc.identifier | http://arxiv.org/abs/math/9902001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/78028 | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.subject | 05A05; 60F99 | |
| dc.title | Longest increasing subsequences of random colored permutations | |
| dc.type | text |