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

Counting -avoiding permutations

โœ Scribed by M.D. Atkinson; Bruce E. Sagan; Vincent Vatter

Book ID
113582370
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
297 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counting permutations
Counting permutations
โœ Ethan D Bolker; Andrew M Gleason ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 383 KB
Shape Avoiding Permutations
Shape Avoiding Permutations
โœ Ron M. Adin; Yuval Roichman ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 121 KB

Permutations avoiding all patterns of a given shape (in the sense of Robinson, Schensted, and Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook and deduce an exponential growth rate for their number.

Almost avoiding permutations
Almost avoiding permutations
โœ Robert Brignall; Shalosh B. Ekhad; Rebecca Smith; Vincent Vatter ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 385 KB
Counting Special Permutations
Counting Special Permutations
โœ Bertram, Edward A.; Gordon, Basil ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB
Restricted 132-Avoiding Permutations
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.