Staircase words and Chebyshev polynomials

From MaRDI portal
Publication:5412643

DOI10.2298/AADM1000010KzbMATH Open1299.05003arXiv0809.0551OpenAlexW1554343055MaRDI QIDQ5412643FDOQ5412643


Authors: Arnold Knopfmacher, Toufik Mansour, Augustine Munagi, Helmut Prodinger Edit this on Wikidata


Publication date: 25 April 2014

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Abstract: A word sigma=sigma1...sigman over the alphabet [k]=1,2,...,k is said to be {em smooth} if there are no two adjacent letters with difference greater than 1. A word sigma is said to be {em smooth cyclic} if it is a smooth word and in addition satisfies |sigmansigma1|le1. We find the explicit generating functions for the number of smooth words and cyclic smooth words in [k]n, in terms of {it Chebyshev polynomials of the second kind}. Additionally, we find explicit formula for the numbers themselves, as trigonometric sums. These lead to immediate asymptotic corollaries. We also enumerate smooth necklaces, which are cyclic smooth words that are not equivalent up to rotation.


Full work available at URL: https://arxiv.org/abs/0809.0551




Recommendations





Cited In (11)





This page was built for publication: Staircase words and Chebyshev polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412643)