Descending subsequences of random permutations
From MaRDI portal
Recommendations
- On increasing subsequences of random permutations
- On the distribution of the length of the longest increasing subsequence of random permutations
- The longest increasing subsequence in a random permutation and a unitary random matrix model
- On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
- scientific article; zbMATH DE number 1047715
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3630761 (Why is no real title available?)
- scientific article; zbMATH DE number 3373691 (Why is no real title available?)
- A variational problem for random Young tableaux
- Ascending sequences in permutations
- Descending subsequences of random permutations
- Longest Increasing and Decreasing Subsequences
Cited in
(12)- Monotonous subsequences and the descent process of invariant random permutations
- Untangling planar graphs from a specified vertex position-Hard cases
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Continuously increasing subsequences of random multiset permutations
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- A note on the expected length of the longest common subsequences of two i.i.d. random permutations
- On the Height of a Random Set of Points in a d-Dimensional Unit Cube
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Optimal online selection of a monotone subsequence: a central limit theorem
- An asymptotically optimal algorithm for online stacking
- Descending subsequences of random permutations
- The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets
This page was built for publication: Descending subsequences of random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908915)
