On avoidance of patterns of the form σ-τ by words over a finite alphabet - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

On avoidance of patterns of the form σ-τ by words over a finite alphabet

Abstract

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$]$n$ avoiding any $τ$ of the form 11$a-b$.
Fichier principal
Vignette du fichier
2559-9778-1-PB.pdf (329.93 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-01349055 , version 1 (26-07-2016)

Identifiers

Cite

Toufik Mansour, Mark Shattuck. On avoidance of patterns of the form σ-τ by words over a finite alphabet. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no.2 (2), pp.181-202. ⟨10.46298/dmtcs.2140⟩. ⟨hal-01349055⟩

Collections

TDS-MACS
56 View
654 Download

Altmetric

Share

Gmail Facebook X LinkedIn More