The number of increasing subsequences of the random permutation

DOI10.1016/0097-3165(81)90049-2zbMath0471.60040OpenAlexW1985197322MaRDI QIDQ1157632

Vladimir Lifschitz, Boris G. Pittel

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90049-2

zbMATH Keywords

random permutations

Mathematics Subject Classification ID

Combinatorial probability (60C05) (L^p)-limit theorems (60F25)

Related Items (6)

Asymptotic results on weakly increasing subsequences in random words ⋮ On an alternative sequence comparison statistic of Steele ⋮ On the value set of small families of polynomials over a finite field. I ⋮ The shifted harmonic oscillator and the hypoelliptic Laplacian on the circle ⋮ Analytic analysis of algorithms ⋮ On the number of words with restrictions on the number of symbols

Cites Work

• An extension of Schensted's theorem
• Subadditive ergodic theory
• A variational problem for random Young tableaux
• Principles of combinatorics
• Longest Increasing and Decreasing Subsequences
• The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of increasing subsequences of the random permutation