On the length of the longest monotone subsequence in a random permutation

A concentration result for the length \(L_ n\) of the longest monotone increasing subsequence of a random permutation of the set \(\{1,2,\dots,n\}\) is proved.

Cited in

(21)

Hammersley's interacting particle process and longest increasing subsequences
Concentration of measure and isoperimetric inequalities in product spaces
A concentration bound for the longest increasing subsequence of a randomly chosen involution
Expected length of the longest common subsequence for large alphabets
A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting
Longest convex chains
Arithmetic subsequences in a random ordering of an additive set
Young tableaux and longest monotone subsequences: An inequality and a conjecture
On the distribution of the length of the longest increasing subsequence of random permutations
A sharp concentration inequality with applications
Noncommutative martingale concentration inequalities
Untangling planar graphs from a specified vertex position-Hard cases
Minimum Number of Monotone Subsequences of Length 4 in Permutations
Connect the dots: how many random points can a regular curve pass through?
A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
Decomposing Random Permutations into Order-Isomorphic Subpermutations
Locally uniform random permutations with large increasing subsequences
Random partial orders defined by angular domains
Random k-dimensional orders: Width and number of linear extensions
On increasing sequences formed by points from a random finite subset of a hypercube
On the limiting distribution for the length of the longest alternating sequence in a random permutation

This page was built for publication: On the length of the longest monotone subsequence in a random permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176972)