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$.

Source : oai:HAL:hal-01349055v1

Volume: Vol. 17 no.2

Section: Combinatorics

Published on: September 16, 2015

Submitted on: February 24, 2014

Keywords: pattern avoidance,vincular patterns,$k$-ary words,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 106 times.

This article's PDF has been downloaded 103 times.