✦ LIBER ✦

Asymptotic enumeration of permutations avoiding generalized patterns

✍ Scribed by Sergi Elizalde

Book ID: 108047088
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 244 KB
Volume: 36
Category: Article
ISSN: 0196-8858
DOI: 10.1016/j.aam.2005.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating Trees for Permutations Avoidi

Generating Trees for Permutations Avoiding Generalized Patterns

✍ Sergi Elizalde 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 316 KB

Enumerating Permutations Avoiding Three

Enumerating Permutations Avoiding Three Babson-Steingrímsson Patterns

✍ Antonio Bernini; Luca Ferrari; Renzo Pinzani 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 251 KB

Generating Functions for Permutations Av

Generating Functions for Permutations Avoiding a Consecutive Pattern

✍ Jeffrey Liese; Jeffrey Remmel 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 330 KB

Asymptotic enumeration of generalized la

Asymptotic enumeration of generalized latin rectangles

✍ Timothy A Green 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Permutations avoiding certain patterns:

Permutations avoiding certain patterns: The case of length 4 and some generalizations

✍ Miklós Bóna 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 767 KB

Proving and disproving some earlier conjectures, we give a characterization of the numbers of permutations avoiding each pattern of length 4. Some implications for longer patterns are included.

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 ''