𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Three problems on the lengths of increasing runs

✍ Scribed by P. Révész

Book ID
107950143
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
405 KB
Volume
15
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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