Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
From MaRDI portal
Publication:2490027
DOI10.1016/j.aam.2005.04.003zbMath1085.05011MaRDI QIDQ2490027
Publication date: 28 April 2006
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2005.04.003
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
42C05: Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis
30B70: Continued fractions; complex-analytic aspects
Related Items
On avoiding 1233, Counting words with Laguerre series, Restricted \(k\)-ary words and functional equations, Stack-sorting for Words
Cites Work
- Unnamed Item
- Forbidden subsequences and Chebyshev polynomials
- Layered restrictions and Chebyshev polynomials
- Words restricted by patterns with at most 2 distinct letters
- Restricted permutations and Chebyshev polynomials
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Restricted 132-avoiding permutations
- Permutations with restricted patterns and Dyck paths