A stirling-type formula for the distribution of the length of longest increasing subsequences

HIGHLIGHTS

  • who: Random permutations Random matrices and colleagues from the Department of, TU Mu00fcnchen, Munich, Germany have published the article: A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences, in the Journal: (JOURNAL)
  • what: For this paper, the following simple criterion is actually all the authors need.

SUMMARY

    Writing permutations in the form σ=(σ1 σ2 · · · σn ) the authors get, e_g, L 9 (σ )=5 for σ=(4 1 2 7 6 5 8 9 3), where one of the longest increasing subsequences has been highlighted. One option-used to . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?