A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 07:23, 5 March 2024

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

    Identifiers