Longest increasing subsequences in pattern-restricted permutations

Details Longest increasing subsequences in pattern-restricted permutations Longest increasing subsequences in pattern-restricted permutations

2003-04-09

arxiv.org/abs/math/0304126v2

Mathematics

Combinatorics

9 pages

Scientific paper

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 limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, and that the (321)-avoiding case has interesting connections with a well known theorem of Erd\H os-Szekeres.

Affiliated with

Also associated with

No associations

Rating

Longest increasing subsequences in pattern-restricted 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 in pattern-restricted permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest increasing subsequences in pattern-restricted permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-559436