arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.03403math.DSmath.COmath.RA
收藏

关于子移位与无限词复杂度的研究

On the complexity of subshifts and infinite words

Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov

AI总结:

本文完整刻画了子移位复杂度函数的渐近等价类,证明非递减、次可乘且至少线性增长是递归子移位复杂度函数的充要条件,并给出显式算法构造。

摘要:

我们刻画了子移位在渐近等价意义下的复杂度函数。每个非周期函数的复杂度函数都是非递减的、次可乘的,并且至少线性增长。我们证明,反过来,每个满足这些条件的函数都渐近等价于某个递归子移位的复杂度函数,等价地,等价于某个递归无限词的复杂度函数。我们的构造是显式的,本质上具有算法性质,其哲学基础是构造某些“整数的康托集”,其“间隙”对应于零块。我们还证明,每个非递减的次可乘函数在相差一个线性误差项的意义下,渐近等价于某个极小子移位的复杂度函数。

英文摘要:

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every function satisfying these conditions is asymptotically equivalent to the complexity function of a recurrent subshift, equivalently, a recurrent infinite word. Our construction is explicit, algorithmic in nature and is philosophically based on constructing certain 'Cantor sets of integers', whose 'gaps' correspond to blocks of zeros. We also prove that every non-decreasing submultiplicative function is asymptotically equivalent, up a linear error term, to the complexity function of a minimal subshift.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑