A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A concentration bound for the longest increasing subsequence of a randomly chosen involution |
scientific article |
Statements
A concentration bound for the longest increasing subsequence of a randomly chosen involution (English)
0 references
17 August 2006
0 references
Ulam's problem
0 references
random involutions
0 references
0 references
0 references
