Longest increasing subsequences of random colored permutations

zbMath0923.05001arXivmath/9902001MaRDI QIDQ1277789

Alexei Borodin

Publication date: 8 March 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9902001

zbMATH Keywords

random permutationlimit distributionincreasing subsequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Limit theorems in probability theory (60F99)

Related Items (11)

Universality for random permutations and some other groups ⋮ On the distribution of the length of the longest increasing subsequence of random permutations ⋮ Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem ⋮ On the longest common increasing binary subsequence ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Expected lengths and distribution functions for Young diagrams in the hook ⋮ Crossings and nestings for arc-coloured permutations and automation ⋮ Longest alternating subsequences of \(k\)-ary words ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ A Hamilton cycle in the \(k\)-sided pancake network ⋮ Ribbon tilings and multidimensional height functions

This page was built for publication: Longest increasing subsequences of random colored permutations