Reproduce “Boxes in Infinite Words: Complexity, Automata, and Point Modules” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jason Bell
The paper counts maximal extendable boxes, families of length-N factors whose choices at each position share one infinite continuation. In the period-doubling word, three length-two factors form two overlapping maximal boxes. If factor complexity is at most linear, box dimension is bounded and, for each fixed positive dimension, the count is eventually affine; dimension-zero counts need not be.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.