Abstract
We study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary ℓ-ary pattern. In several interesting cases the generating function depends only on ℓ and is expressed via Chebyshev polynomials of the second kind and continued fractions.
Original language | English |
---|---|
Pages (from-to) | 175-193 |
Number of pages | 19 |
Journal | Advances in Applied Mathematics |
Volume | 36 |
Issue number | 2 |
DOIs | |
State | Published - Feb 2006 |
Keywords
- Chebyshev polynomials
- Continued fractions
- Forbidden subsequence
- Restricted k-ary words
- k-ary words
ASJC Scopus subject areas
- Applied Mathematics