activity
20092026
most citedEnumeration of closed random walks in the square lattice according to their areas

1 citations · 2 across the 6 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

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.…