A Set of Sequences of Complexity 2n+1 2 n + 1
A Set of Sequences of Complexity 2n+1 2 n + 1
复制标题
一组复杂的序列 2n 1 2 n 1
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
J. Leroy
中科院分区：
文献类型：
--
作者：
J. Cassaigne;S. Labbé;J. Leroy
我们证明了对于任意给定的合理独立字母频率的向量，具有因子复杂度（2n+1）的三元序列的存在性。这种序列是根据一种特殊的多维连分式算法，由两个替换的无穷积构造而成的。我们证明了这个算法是共轭的一个著名的算法，Selmer算法。实验（Baldwin, 1992）表明他们的第二Lyapunov指数是负的，预示着有限平衡的性质。
We prove the existence of a ternary sequence of factor complexity (2n+1) for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a particular Multidimensional Continued Fraction algorithm. We show that this algorithm is conjugate to a well-known one, the Selmer algorithm. Experimentations (Baldwin, 1992) suggest that their second Lyapunov exponent is negative which presages finite balance properties.