2 papers
cs.FL2026
Frequencies of subwords in words of linear subword complexity
Jason Bell, Laindon Burnett, Chris Schulz
Using a method of Balková--Pelantová, we show that if is a right-infinite word over a finite alphabet, then for each nonnegative integer there are at most $3(p_{\bf w…
math.CO2024
Consecutive Power Occurrences in Sturmian Words
Jason Bell, Chris Schulz, Jeffrey Shallit
We show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by and this bound is…