✦ LIBER ✦

On bijections for pattern-avoiding permutations

✍ Scribed by Jonathan Bloom; Dan Saracino

Book ID: 108167274
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 250 KB
Volume: 116
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.03.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Another look at bijections for pattern-a

Another look at bijections for pattern-avoiding permutations

✍ Jonathan Bloom; Dan Saracino 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Pattern Avoidance in Multiset Permutatio

Pattern Avoidance in Multiset Permutations: Bijective Proof

✍ Amy N. Myers 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 204 KB

Generating Functions for Permutations Av

Generating Functions for Permutations Avoiding a Consecutive Pattern

✍ Jeffrey Liese; Jeffrey Remmel 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 330 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

Combinatorial Gray codes for classes of

Combinatorial Gray codes for classes of pattern avoiding permutations

✍ W.M.B. Dukes; M.F. Flanagan; T. Mansour; V. Vajnovszki 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Generating Trees for Permutations Avoidi

Generating Trees for Permutations Avoiding Generalized Patterns

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