2 papers
math.CO2026
Binomial Complexity of Multidimensional Arrays
Mehdi Golafshan, Michel Rigo
Binomial coefficients for multidimensional arrays count occurrences of particular configurations. For the sake of presentation, the emphasis is put on column-binomial coefficients…
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…