Showing math.COShow all
2 papers · 1 filter
math.CO2024
Computing the k-binomial complexity of generalized Thue--Morse words
M. Golafshan, M. Rigo, M. Whiteland
Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an…
math.CO2024
Introducing q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo, Markus A. Whiteland
Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements…