Longest increasing subsequences in pattern-restricted permutations

zbMath1011.05008arXivmath/0304126MaRDI QIDQ1871367

Adolf Hildebrand, Herbert S. Wilf, Emeric Deutsch

Publication date: 7 May 2003

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

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

zbMATH Keywords

random permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (14)

Monotone subsets in lattices and the Schensted shape of a Sós permutation ⋮ Unnamed Item ⋮ Bijections for refined restricted permutations ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ The shape of random pattern-avoiding permutations ⋮ Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons ⋮ Longest alternating subsequences of \(k\)-ary words ⋮ Strategy-indifferent games of best choice ⋮ Avoiding patterns and making the best choice ⋮ Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations ⋮ Refined sign-balance on 321-avoiding permutations ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ Edit distance between unlabeled ordered trees ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations

This page was built for publication: Longest increasing subsequences in pattern-restricted permutations