Counting l-letter subwords in compositions
Discrete mathematics & theoretical computer science, Tome 8 (2006).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2006_8_a17,
     author = {Mansour, Toufik and Sirhan, Basel O.},
     title = {Counting l-letter subwords in compositions},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {8},
     year = {2006},
     doi = {10.46298/dmtcs.376},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.376/}
}
TY  - JOUR
AU  - Mansour, Toufik
AU  - Sirhan, Basel O.
TI  - Counting l-letter subwords in compositions
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.376/
DO  - 10.46298/dmtcs.376
LA  - en
ID  - DMTCS_2006_8_a17
ER  - 
%0 Journal Article
%A Mansour, Toufik
%A Sirhan, Basel O.
%T Counting l-letter subwords in compositions
%J Discrete mathematics & theoretical computer science
%D 2006
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.376/
%R 10.46298/dmtcs.376
%G en
%F DMTCS_2006_8_a17
Mansour, Toufik; Sirhan, Basel O. Counting l-letter subwords in compositions. Discrete mathematics & theoretical computer science, Tome 8 (2006). doi : 10.46298/dmtcs.376. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.376/

Cité par Sources :