与字母加倍映射有关的置换复杂度
Permutation Complexity Related to the Letter Doubling Map
摘要:
给定一个可数集X(通常取为自然数或整数),X的一个无限置换π是X的一个线性序。本文研究了在字母加倍映射下,与一致递归非周期二进制字象相联系的自然数上无穷置换的组合复杂性。对于一般的词,给出了复杂度的上界,对于Sturmian词和Thue-Morse词,给出了复杂度的计算公式。
英文摘要:
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, π, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural numbers associated with the image of uniformly recurrent aperiodic binary words under the letter doubling map. An upper bound for the complexity is found for general words, and a formula for the complexity is established for the Sturmian words and the Thue-Morse word.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。