No CrossRef data available.
Article contents
Young tableaux and longest monotone subsequences: An inequality and a conjecture
Published online by Cambridge University Press: 20 January 2009
Extract
Much work has been done on the following problem, which is sometimes referred to as Ulam's problem: what is the distribution of , the length (i.e. number of terms) of a longest monotone increasing [decreasing] subsequence of (not necessarily consecutive) terms in a random permutation of the first N integers? For example, it has been shown that converges almost surely to 2 [6,7,9]. In some cases, it is important to know the value of βN(j), the number of permutations for which αN=j
- Type
- Research Article
- Information
- Proceedings of the Edinburgh Mathematical Society , Volume 27 , Issue 3 , October 1984 , pp. 341 - 344
- Copyright
- Copyright © Edinburgh Mathematical Society 1984