๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Restricted Dumont Permutations

โœ Scribed by Alexander Burstein


Book ID
105764701
Publisher
Springer
Year
2005
Tongue
English
Weight
139 KB
Volume
9
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Restricted permutations
โœ M.D. Atkinson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations t

Restricted Symmetric Permutations
โœ Eric S. Egge ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer ๐ŸŒ English โš– 375 KB
Restricted 132-Avoiding Permutations
โœ Toufik Mansour; Alek Vainshtein ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation ฯ„ on k letters, or containing ฯ„ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.

Restricted permutations and queue jumpin
โœ M.H. Albert; R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB