arXiv · 2611.21772
Boxes in Infinite Words: Complexity, Automata, and Point Modules
Abstract
Motivated by the geometry of point modules over monomial algebras, we introduce a box-counting function associated to a right-infinite word over a finite alphabet. An extendable box is a family of finite words obtained by choosing letters independently at each position, subject to the condition that all choices admit a common infinite right continuation in the associated subshift. We prove several results for these functions for words of linearly bounded complexity. For $k$-automatic words, we show using techniques from first-order logic that the total box-counting function is $k$-regular. Finally, we apply our results to prove eventual affine growth of the number of positive-dimensional irreducible components in finite projections of point-module spaces associated to semiprime monomial algebras of at most quadratic growth.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jason Bell. 2026-11-16. Boxes in Infinite Words: Complexity, Automata, and Point Modules. https://searcharxiv.com/abs/2611.21772
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.