✦ LIBER ✦

Generating Functions for Permutations Avoiding a Consecutive Pattern

✍ Scribed by Jeffrey Liese; Jeffrey Remmel

Publisher: Springer
Year: 2010
Tongue: English
Weight: 330 KB
Volume: 14
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-010-0049-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permutations avoiding consecutive patter

Permutations avoiding consecutive patterns, II

✍ Richard Warlimont 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 69 KB

Generating Trees for Permutations Avoidi

Generating Trees for Permutations Avoiding Generalized Patterns

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

Generating functions for certain types o

Generating functions for certain types of permutations

✍ L Carlitz; Richard Scoville 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 414 KB

On the Number of Permutations Avoiding a

On the Number of Permutations Avoiding a Given Pattern

✍ Noga Alon; Ehud Friedgut 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c

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.

A simplified loop-free algorithm for gen

A simplified loop-free algorithm for generating permutations

✍ Nachum Dershowitz 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 350 KB