%0 Journal Article
%T Centrosymmetric words avoiding 3-letter permutation patterns
%A Luca S. Ferrari
%J Online Journal of Analytic Combinatorics
%D 2011
%I University of Auckland
%X 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.
%U http://analytic-combinatorics.org/index.php/ojac/article/view/39