𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting Occurrences of 132 in a Permutation

✍ Scribed by Toufik Mansour; Alek Vainshtein

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
104 KB
Volume
28
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

✦ Synopsis

We study the generating function for the number of permutations on n letters containing exactly r β‰₯ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S 2r .  2002 Elsevier Science (USA)

πŸ“œ SIMILAR VOLUMES

Counting orbits of a product of permutat
Counting orbits of a product of permutations
✍ Richard Z. Goldstein; Edward C. Turner πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 252 KB

A formula is derived for the number of orbits of a product of permutation in terms of the number of orbits of the factors and the nullity of a matrix.

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

Dense Packing of Patterns in a Permutati
Dense Packing of Patterns in a Permutation
✍ Henrik Eriksson; Kimmo Eriksson; Svante Linusson; Johan WΓ€stlund πŸ“‚ Article πŸ“… 2007 πŸ› Springer 🌐 English βš– 190 KB