Statistics for 3-letter patterns with repetitions in compositions
A composition $\pi = \pi_1 \pi_2 \cdots \pi_m$ of a positive integer $n$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands, namely $m$, is called the number of parts of $\pi$. Using linear algebra, we determine formulas for generating functions that c...
Main Authors: | Armend Shabani, Rexhep Gjergji |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2016-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2156/pdf |
Similar Items
-
Counting occurrences of some subword patterns
by: Alexander Burstein, et al.
Published: (2003-01-01) -
Enumeration of words by the sum of differences between adjacent letters
by: Toufik Mansour
Published: (2009-01-01) -
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01) -
String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01) -
Waiting time distributions for pattern occurrence in a constrained sequence
by: Valeri T. Stefanov, et al.
Published: (2007-01-01)