On the length of the longest monotone subsequence in a random permutation (Q1176972)

From MaRDI portal
Revision as of 16:05, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references