𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordered partitions avoiding a permutation pattern of length 3

✍ Scribed by Chen, William Y.C.; Dai, Alvin Y.L.; Zhou, Robin D.P.

Book ID
122091912
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
383 KB
Volume
36
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Permutations of a Multiset Avoiding Perm
Permutations of a Multiset Avoiding Permutations of Length 3
✍ M.H. Albert; R.E.L. Aldred; M.D. Atkinson; C. Handley; D. Holton πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 107 KB

We consider permutations of a multiset which do not contain certain ordered patterns of length 3. For each possible set of patterns we provide a structural description of the permutations avoiding those patterns, and in many cases a complete enumeration of such permutations according to the underlyi

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