On the length of the longest monotone subsequence in a random permutation (Q1176972)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the length of the longest monotone subsequence in a random permutation |
scientific article; zbMATH DE number 12784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the length of the longest monotone subsequence in a random permutation |
scientific article; zbMATH DE number 12784 |
Statements
On the length of the longest monotone subsequence in a random permutation (English)
0 references
25 June 1992
0 references
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.
0 references
martingale inequality
0 references
random permutation
0 references
