arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1312.7820cs.DMmath.CO
收藏

薄算术离散平面的临界连通性

Critical connectedness of thin arithmetical discrete planes

Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal

摘要:

如果一个算术离散平面的厚度等于保持其$2$ -连通性的一组值的下确界,则称该平面具有临界连通厚度。该下确界厚度可以通过全减法算法计算。这种多维连分数算法在其线性形式中包括减去其他项的最小项。我们提供了一个具有临界厚度的离散平面的表征,具有零截距和$2$连接。我们的工具依赖于对偶替换的概念,对偶替换是作用于词的通常替换概念的几何版本。我们与全减法算法的一组替换,其关联矩阵提供的算法的矩阵,并证明了它们的几何对应生成算术离散平面。

英文摘要:

An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully subtractive algorithm. This multidimensional continued fraction algorithm consists, in its linear form, in subtracting the smallest entry to the other ones. We provide a characterization of the discrete planes with critical thickness that have zero intercept and that are $2$-connected. Our tools rely on the notion of dual substitution which is a geometric version of the usual notion of substitution acting on words. We associate with the fully subtractive algorithm a set of substitutions whose incidence matrix is provided by the matrices of the algorithm, and prove that their geometric counterparts generate arithmetic discrete planes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑