Sciweavers

13 search results - page 1 / 3
» Longest Increasing Subsequences of Random Colored Permutatio...
Sort
View
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
13 years 4 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 5 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
13 years 4 months ago
Increasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
Eric M. Rains
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
13 years 5 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
Piotr Sniady