𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permutations with one or two 132-subsequences

✍ Scribed by Miklós Bóna

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
370 KB
Volume
181
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove a strikingly simple formula for the number of permutations containing exactly one subsequence of type 132. We show that this number equals the number of partitions of a convex (n + 1 )-gon into n -2 parts by noncrossing diagonals. We also prove a recursive formula for the number d, of those containing exactly two such subsequences, yielding that {d,} is P-recursive. (~) 1998 Elsevier Science B.V.

📜 SIMILAR VOLUMES

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

Optimizing enzyme assays with one or two
Optimizing enzyme assays with one or two coupling enzymes
✍ F. García-Carmona; F. García-Cánovas; J.A. Lozano 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 355 KB

The cost of assays using one or two coupling enzymes is optimized by using equations to calculate the minimum amount(s) of enzyme(s) which should be used to obtain a given time (r& in which 99% of the rate V, of the first reaction is obtained. Using two coupling enzymes and given a value of rae, the