Counting l-letter subwords in compositions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2006

Counting l-letter subwords in compositions

Abstract

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.
Fichier principal
Vignette du fichier
502-2077-1-PB.pdf (210.02 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00961119 , version 1 (20-03-2014)

Identifiers

Cite

Toufik Mansour, Basel O. Sirhan. Counting l-letter subwords in compositions. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.285--297. ⟨10.46298/dmtcs.376⟩. ⟨hal-00961119⟩

Collections

TDS-MACS
47 View
712 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More