Geodesic
Enumeration schemes for permutations avoiding barred patterns
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length $\leq 4$. We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length $>4$ or a set of barred patterns.
DOI : 10.37236/301
Classification : 05A05 
@article{10_37236_301,
     author = {Lara Pudwell},
     title = {Enumeration schemes for permutations avoiding barred patterns},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/301},
     zbl = {1215.05006},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/301/}
}
TY  - JOUR
AU  - Lara Pudwell
TI  - Enumeration schemes for permutations avoiding barred patterns
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/301/
DO  - 10.37236/301
ID  - 10_37236_301
ER  - 
%0 Journal Article
%A Lara Pudwell
%T Enumeration schemes for permutations avoiding barred patterns
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/301/
%R 10.37236/301
%F 10_37236_301
Lara Pudwell. Enumeration schemes for permutations avoiding barred patterns. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/301

Cité par Sources :