2 papers
math.CO2026
Binary binomial equivalence via hyperplane arrangements
Mehdi Golafshan
Rigo and Salimov (2015) proved that the number of binary \(2\)-binomial equivalence classes of words of length \(n\) is the \(n^{\text{th}}\) cake number. We give a geometric expla…
math.CO2026
Enumeration of Factor Occurrences in -Bonacci Words over an Infinite Alphabet
Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1
We study the -Bonacci word over the infinite alphabet . Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…