✦ LIBER ✦

The number of increasing subsequences of the random permutation

✍ Scribed by V Lifschitz; B Pittel

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 729 KB
Volume: 31
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(81)90049-2

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

The number of permutations containing ex

The number of permutations containing exactly one increasing subsequence of length three

✍ John Noonan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

It is proved that the number of permuations on {I, 2, ... , n} with exactly one increasing subsequence of length 3 is ~(ntn3) [0,0,1,6,27,110,429, ... (Sloane A3517)]. Given a permutaion a E Sn, an abc subsequence is a set of three elements, a(i), aU), a(k), with a(i) < aU) < a(k) and i < j < k. It

The Number of Permutations with Exactlyr

The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size!

✍ Miklós Bóna 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Proving a first nontrivial instance of a conjecture of Noonan and Zeilberger we Ž . show that the number S n of permutations of length n containing exactly r r subsequences of type 132 is a P-recursive function of n. We show that this remains true even if we impose some restrictions on the permutati

The number of orthogonal permutations

✍ Akihiro Nozaki; Masahiro Miyakawa; Grant Pogosyan; Ivo G Rosenberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 652 KB

The number of baxter permutations

✍ F.R.K Chung; R.L Graham; V.E Hoggatt Jr.; M Kleiman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 519 KB

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