✦ LIBER ✦

The maximal-inversion statistic and pattern-avoiding permutations

✍ Scribed by Sook Min; SeungKyung Park

Book ID: 108114057
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 891 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.06.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Coloured Permutations Containing and Avo

Coloured Permutations Containing and Avoiding Certain Patterns

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

Pattern avoidance in compositions and mu

Pattern avoidance in compositions and multiset permutations

✍ Carla D. Savage; Herbert S. Wilf 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 80 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.

Symbolic Moment Calculus I: Foundations

Symbolic Moment Calculus I: Foundations and Permutation Pattern Statistics

✍ Doron Zeilberger 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 161 KB

Some Combinatorics Related to Central Bi

Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations

✍ Luca Ferrari 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 354 KB