Geodesic
On avoidance of patterns of the form σ-τ by words over a finite alphabet
Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2.

Voir la notice de l'article provenant de la source Episciences

Vincular or dashed patterns resemble classical patterns except that some of the letters within an occurrence are required to be adjacent. We prove several infinite families of Wilf-equivalences for $k$-ary words involving vincular patterns containing a single dash, which explain the majority of the equivalences witnessed for such patterns of length four. When combined with previous results, numerical evidence, and some arguments in specific cases, we obtain the complete Wilf-classification for all vincular patterns of length four containing a single dash. In some cases, our proof shows further that the equivalence holds for multiset permutations since it is seen to respect the number of occurrences of each letter within a word. Some related enumerative results are provided for patterns $τ$ of length four, among them generating function formulas for the number of members of [$k$]<sup>$n$</sup> avoiding any $τ$ of the form 11$a-b$. 
@article{DMTCS_2015_17_2_a12,
     author = {Mansour, Toufik and Shattuck, Mark},
     title = {On avoidance of patterns of the form \ensuremath{\sigma}-\ensuremath{\tau} by words over a finite alphabet},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2015-2016},
     doi = {10.46298/dmtcs.2140},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2140/}
}
TY  - JOUR
AU  - Mansour, Toufik
AU  - Shattuck, Mark
TI  - On avoidance of patterns of the form σ-τ by words over a finite alphabet
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2140/
DO  - 10.46298/dmtcs.2140
LA  - en
ID  - DMTCS_2015_17_2_a12
ER  - 
%0 Journal Article
%A Mansour, Toufik
%A Shattuck, Mark
%T On avoidance of patterns of the form σ-τ by words over a finite alphabet
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2140/
%R 10.46298/dmtcs.2140
%G en
%F DMTCS_2015_17_2_a12
Mansour, Toufik; Shattuck, Mark. On avoidance of patterns of the form σ-τ by words over a finite alphabet. Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2. doi : 10.46298/dmtcs.2140. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2140/

Cité par Sources :