✦ LIBER ✦

Generating Trees for Permutations Avoiding Generalized Patterns

✍ Scribed by Sergi Elizalde

Publisher: Springer
Year: 2007
Tongue: English
Weight: 316 KB
Volume: 11
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-007-0328-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating Functions for Permutations Av

Generating Functions for Permutations Avoiding a Consecutive Pattern

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

Generalized Pattern Avoidance

✍ Anders Claesson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Recently, Babson and Steingrímsson have introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of permutations

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.

Restricted 1-3-2 Permutations and Genera

Restricted 1-3-2 Permutations and Generalized Patterns

✍ Toufik Mansour 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 99 KB

Generating coset representatives for per

Generating coset representatives for permutation groups

✍ Lloyd Allison 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 840 KB

Generalization of a Suffix Tree for RNA

Generalization of a Suffix Tree for RNA Structural Pattern Matching

✍ Tetsuo Shibuya 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 354 KB