Descending subsequences of random permutations

DOI10.1016/0097-3165(90)90022-OzbMath0694.05004MaRDI QIDQ908915

Shaiy Pilpel

Publication date: 1990

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

zbMATH Keywords

combinatorial identitiesrandom permutationlongest descending subsequence

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items

Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem, A note on the expected length of the longest common subsequences of two i.i.d. random permutations, 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, Optimal online selection of a monotone subsequence: a central limit theorem, Untangling planar graphs from a specified vertex position-Hard cases, Improved Bounds on Security Reductions for Discrete Log Based Signatures, On the Height of a Random Set of Points in a d-Dimensional Unit Cube

Cites Work

• Descending subsequences of random permutations
• A variational problem for random Young tableaux
• Ascending sequences in permutations
• Longest Increasing and Decreasing Subsequences
• Unnamed Item
• Unnamed Item
• Unnamed Item