← 研踪 PaperTrailarXiv:2611.21772 · v1
Boxes in Infinite Words: Complexity, Automata, and Point Modules
首次提交 2026-11-17 03:04
版本更新 2026-11-17 03:04
雷达观测 2026-11-18 19:44
摘要
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 -automatic words, we show using techniques from first-order logic that the total box-counting function is -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.
作者备注:23 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 03:04 · 最新观测版本
Boxes in Infinite Words: Complexity, Automata, and Point Modules
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 -automatic words, we show using techniques from first-order logic that the total box-counting function is -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.
查看此版本解读 →查看此版本原文 ↗