有理基数记数系统中表示树的子树
On subtrees of the representation tree in rational base numeration systems
AI总结:
本文研究有理基数记数系统中整数表示树的子树,引入底词、顶词和跨度词,证明跨度词集被无限自动机接受,底词更新由无限转换器实现,并刻画跨度集合的拓扑闭包:当 p≥2q-1 时为区间,否则为零测康托集。
摘要:
每个有理数 p/q 定义一个有理基数记数系统,在该系统中,每个整数都有一个唯一的有限表示,直到前导零。这项工作是对整数表示集合研究的贡献。自由幺半群的这个前缀封闭子集自然地表示为一棵高度非正则的树。其节点是整数,其边带有取自 {0,1,...,p-1} 的标签,并且其子树都是不同的。\n 我们将每个子树(或其根 n)与三个无限词关联。n 的底词是子树分支标签的字典序最小的词。n 的顶词类似定义。n 的跨度词是后者与前者之间的按位差。\n 首先,我们证明所有跨度词的集合被一个无限自动机接受,其底层图本质上与树本身相同。其次,我们研究一个函数,该函数对所有 n 计算与 n+1 关联的底词,从与 n 关联的底词出发,并证明它由一个无限序列转换器实现,其底层图再次本质上与树本身相同。\n 一个无限词可以解释为基数 p/q 在小数点后的展开,因此可以求值为一个实数。如果 T 是以 n 为根的子树,则 T 的分支标签的求值形成一个实数区间。该区间的长度称为 n 的跨度,等于 n 的跨度词的求值。所有跨度的集合是 R 的一个子集,我们使用前面的构造来研究其拓扑闭包。我们证明当 p 大于或等于 2q-1 时它是一个区间,否则是一个测度为零的康托集。
英文摘要:
Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers. This prefix-closed subset of the free monoid is naturally represented as a highly non-regular tree. Its nodes are the integers, its edges bear labels taken in {0,1,...,p-1}, and its subtrees are all distinct. We associate with each subtree (or with its root n) three infinite words. The bottom word of n is the lexicographically smallest word that is the label of a branch of the subtree. The top word of n is defined similarly. The span-word of n is the digitwise difference between the latter and the former. First, we show that the set of all the span-words is accepted by an infinite automaton whose underlying graph is essentially the same as the tree itself. Second, we study the function that computes for all n the bottom word associated with n+1 from the one associated with n, and show that it is realised by an infinite sequential transducer whose underlying graph is once again essentially the same as the tree itself. An infinite word may be interpreted as an expansion in base p/q after the radix point, hence evaluated to a real number. If T is a subtree whose root is n, then the evaluations of the labels of the branches of T form an interval of $\mathbb{R}$. The length of this interval is called the span of n and is equal to the evaluation of the span-word of n. The set of all spans is then a subset of R and we use the preceding construction to study its topological closure. We show that it is an interval when p is greater than or equal to 2q-1, and a Cantor set of measure zero otherwise.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。