Enumeration of r-smooth words over a finite alphabet

DOI10.47443/dml.2022.175OpenAlexW4318766031WikidataQ130258097 ScholiaQ130258097MaRDI QIDQ5889960

José L. Ramírez, Diego Villamizar, Toufik Mansour

Publication date: 28 April 2023

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2022.175

zbMATH Keywords

automatagenerating function\(k\)-ary word

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Patterns in permutations and words.
• Smooth column convex polyominoes
• Counting inversion sequences by parity successions and runs
• On the enumeration of restricted words over a finite alphabet
• Connection between ordinary multinomials, generalized Fibonacci numbers, partial Bell partition polynomials and convolution powers of discrete uniform distribution
• Staircase words and Chebyshev polynomials
• Analytic and Geometric Representations of the Generalized n-anacci Constants
• Smooth partitions and Chebyshev polynomials