Local extrema in random permutations and the structure of longest alternating subsequences

HIGHLIGHTS

• who: DMTCS proc. AO and colleagues from the Department of Mathematics, University of California, Davis, CA, USA have published the Article: Local extrema in random permutations and the structure of longest alternating subsequences, in the Journal: (JOURNAL)

SUMMARY

Let x1,.., xn be a sequence of distinct real numbers. A subsequence xi1,.., xik, where 1 ≤ i1 and amp;lt;.. and amp;lt; ik ≤ n, is called an alternating subsequence if it satisfies xi1 > xi2 and amp;lt; xi3 >... xk. † Supported by the National Science Foundation under grant DMS-0955584. For 2 ≤ k ≤ n - 1 . . .

 



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

Thanks :)

Username or Email

Password

Remember me

Lost your password?

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