多项式复杂性极值序列
Extremal sequences of polynomial complexity
摘要:
定义有界$d \times d$实矩阵集合的联合谱半径为从该集合中抽取的矩阵乘积的最大可能指数增长性。对于一个固定的矩阵集合,如果相关的部分乘积序列达到这个最大增长率,则从该集合中提取的矩阵序列称为\emph{extremal}。J.Lagarias和Y.王问是否每一个有限集的矩阵承认一个极值序列是周期性的。这等价于断言每一个有限的矩阵集合都有一个子字复杂度有界的极值序列。反例随后被构造,其具有每个极值序列至少具有线性子字复杂度的性质。本文推广了这一结果,证明了对于每个整数$p \geq 1$,存在一对维数为$2^p(2^{p+1}-1)$的方阵,使得每个极值序列的子字复杂度至少为$2^{-p^2}n^p$ .
英文摘要:
The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called \emph{extremal} if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. Wang asked whether every finite set of matrices admits an extremal sequence which is periodic. This is equivalent to the assertion that every finite set of matrices admits an extremal sequence with bounded subword complexity. Counterexamples were subsequently constructed which have the property that every extremal sequence has at least linear subword complexity. In this paper we extend this result to show that for each integer $p \geq 1$, there exists a pair of square matrices of dimension $2^p(2^{p+1}-1)$ for which every extremal sequence has subword complexity at least $2^{-p^2}n^p$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。