𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On increasing subsequences of minimal Erdös-Szekeres permutations

✍ Scribed by Zhong Gen Su

Book ID
106279840
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
196 KB
Volume
27
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the Law of The Iterated Logarithm for
On the Law of The Iterated Logarithm for Rapidly Increasing Subsequences
✍ Rainer Schwabe; Allan Gut 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 490 KB

The usual law of the iterated logarithm states that the partial sums Sn of independent and identically distributed random variables can be normalized by the sequence an = d -, such that limsup,,, &/a, = t/z a. 9.. As has been pointed out by GUT (1986) the law fails if one considers the limsup along