✦ LIBER ✦

Restricted 132-Avoiding Permutations

✍ Scribed by Toufik Mansour; Alek Vainshtein

Book ID: 102559598
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 104 KB
Volume: 26
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.2000.0719

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Restricted 132-Alternating Permutations

Restricted 132-Alternating Permutations and Chebyshev Polynomials

✍ Toufik Mansour 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 285 KB

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

✍ Robert Brignall; Shalosh B. Ekhad; Rebecca Smith; Vincent Vatter 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 385 KB

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 Dumont Permutations

✍ Alexander Burstein 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 139 KB

Restricted Symmetric Permutations

✍ Eric S. Egge 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 375 KB