Centrosymmetric words avoiding 3-letter permutation patterns

Luca S. Ferrari 1
1Dipartimento di Matematica, Universit`a di Bologna Piazza di Porta San Donato, 5 – 40126 Bologna, Italy

Abstract

A word is centrosymmetric if it is invariant under the reverse-complement map. In this paper, we give  enumerative results on k-ary centrosymmetric words of length n avoiding a pattern of length 3 with no repeated letters.