✦ LIBER ✦

On unimodal subsequences

✍ Scribed by F.R.K Chung

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 557 KB
Volume: 29
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90021-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long unimodal subsequences: a problem of

Long unimodal subsequences: a problem of F.R.K. Chung

✍ J.Michael Steele 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Let I(n) be the expected length of the longest unimodal subsequence of a random permutation. It is proved here that Z(n)/& converges to 24. This settles a conjecture of F.R.K. Chung. Let p denote a permutation of {1,2, . . . z n) and call (a, < a,\*: l l l < q} a u?Gmxkzl subsequence provided there

On summability of subsequences

✍ Karl Klee; Peter Szüsz 📂 Article 📅 1969 🏛 Springer-Verlag 🌐 French ⚖ 348 KB

On uniform distribution of subsequences

✍ V. Losert; R. F. Tichy 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 509 KB

Searching subsequences

✍ Ricardo A. Baeza-Yates 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 829 KB

On Increasing Subsequences of Random Per

On Increasing Subsequences of Random Permutations

✍ Jeong Han Kim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Let L n be the length of a longest increasing subsequence in a random permutation of [1, ..., n]. It is known that the expected value of L n is asymptotically equal to 2 -n as n gets large. This note derives upper bound on the probability that L n &2 -n exceeds certain quantities. In particular, we

Unimodal smoothing

✍ Paul H. C. Eilers 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB