On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation

DOI10.1002/rsa.20140zbMath1129.05002arXivmath/0505485OpenAlexW2950697277MaRDI QIDQ5433259

Michael Henry Albert

Publication date: 8 January 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

distributionStanley-Wilf limit

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (7)

Variations on Hammersley’s interacting particle process ⋮ Unsplittable classes of separable permutations ⋮ Generalized Coloring of Permutations ⋮ Growing at a Perfect Speed ⋮ On the growth of merges and staircases of permutation classes ⋮ Lower bounds for superpatterns and universal sequences ⋮ PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188

Cites Work

• Longest Increasing and Decreasing Subsequences
• Restricted permutations

This page was built for publication: On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation