On the length of the longest monotone subsequence in a random permutation (Q1176972): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q94767378, #quickstatements; #temporary_batch_1722442319438 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1214/aoap/1177005939 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1214/AOAP/1177005939 / rank | |||
Normal rank | |||
Latest revision as of 17:05, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the length of the longest monotone subsequence in a random permutation |
scientific article |
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
