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