改进的$n$ -Brinkhuis $k$ -三元组下界
An Improved Lower Bound for $n$-Brinkhuis $k$-Triples
摘要:
令$s_n$是由数字0、1和2组成的三进制字母表组成的字的数目,使得没有子字(或因子)是正方形(与自身连接的字,例如,$11$、$1212$或$102102$)。根据计算证据,$s_n$以大约$1.317277^n$的速率呈指数增长。虽然已知的上界已经相对接近的限制率,有效的下限是更难以获得。本文构造了一个$54$ -$952$ -三元组,得到了一个改进的$n$ -字母三元无平方字个数的下界:$952^{n/53} \approx 1.1381531^n$ .
英文摘要:
Let $s_n$ be the number of words consisting of the ternary alphabet consisting of the digits 0, 1, and 2 such that no subword (or factor) is a square (a word concatenated with itself, e.g., $11$, $1212$, or $102102$). From computational evidence, $s_n$ grows exponentially at a rate of about $1.317277^n$. While known upper bounds are already relatively close to the conjectured rate, effective lower bounds are much more difficult to obtain. In this paper, we construct a $54$-Brinkhuis $952$-triple, which leads to an improved lower bound on the number of $n$-letter ternary squarefree words: $952^{n/53} \approx 1.1381531^n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。