Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-00961119
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 20, 2014 - 8:30:59 AM
Last modification on : Wednesday, November 29, 2017 - 10:26:24 AM
Long-term archiving on: : Friday, June 20, 2014 - 10:45:22 AM

File

502-2077-1-PB.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00961119, version 1

Collections

Citation

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

Share

Metrics

Record views

158

Files downloads

752