𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stirling numbers interpolation using permutations with forbidden subsequences

✍ Scribed by G. Labelle; P. Leroux; E. Pergola; R. Pinzani

Book ID
111713999
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
183 KB
Volume
246
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Enumeration of Permutations with a P
The Enumeration of Permutations with a Prescribed Number of β€œForbidden” Patterns
✍ John Noonan; Doron Zeilberger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''

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