Paperlane

no. 17 · Wednesday 18 November 2026

Boxes in Infinite Words: Complexity, Automata, and Point Modules

Jason Bell

math.LO · via cs.FL · 23 pp

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.

comments
23 pages
fields
Logic, Rings and Algebras
pdf ↗ page arXiv:2611.21772 ↗