%0 Journal Article
%T Counting  -letter subwords in compositions
%A Toufik Mansour
%A Basel Sirhan
%J Discrete Mathematics & Theoretical Computer Science
%D 2006
%I Discrete Mathematics & Theoretical Computer Science
%X Let   be the set of all positive integers and let A be any ordered subset of  . Recently, Heubach and Mansour enumerated the number of compositions of n with m parts in A that contain the subword ¦Ó exactly r times, where ¦Ó¡Ê{111,112,221,123}. Our aims are (1) to generalize the above results, i.e., to enumerate the number of compositions of n with m parts in A that contain an  -letter subword, and (2) to analyze the number of compositions of n with m parts that avoid an  -letter pattern, for given  . We use tools such as asymptotic analysis of generating functions leading to Gaussian asymptotic.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/502