Chris Schulz

works on

combinatorics on words 1 frequency analysis 1 infinite words 1 linear complexity 1 subword complexity 1

From the 1 of 2 linked papers with an AI index.

collaborators

2 papers

cs.FL2026

Frequencies of subwords in words of linear subword complexity

Jason Bell, Laindon Burnett, Chris Schulz

The paper establishes upper bounds on the number of distinct frequencies of subwords in right‑infinite words with linear subword complexity, and shows that these bounds can be exce…

math.LO2026

A Dichotomy for $k$ -automatic expansions of Presburger Arithmetic

Jason Bell, Alexi Block Gorman, Chris Schulz

Let $k \geq 2$ and let $X$ be a subset of the natural numbers that is $k$ -automatic and not eventually periodic. We show that the following dichotomy holds: either all $k$ -automatic…

Frequencies of subwords in words of linear subword complexity

A Dichotomy for k-automatic expansions of Presburger Arithmetic

A Dichotomy for $k$ -automatic expansions of Presburger Arithmetic