arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.10046math.DS
收藏

连分数算法的不变密度计算

Computation of invariant densities for continued fraction algorithms

Paul Mercat

AI总结:

本文引入矩阵图概念,提出将一般连分数算法转换及计算精确不变密度的算法,并针对经典加法算法的有限扩展和任意有限二次数集合构造相应算法。

摘要:

我们引入了矩阵图的概念,用于定义过去与未来几乎独立的连分数算法。我们提供了一种算法,可将更一般的算法转换为矩阵图。我们提出了一种算法,用于计算某些连分数算法的精确不变密度,包括经典算法及其部分扩展。对于经典加法算法(含两个坐标)的有限扩展,我们给出了一种更精确的算法,该算法可判定不变密度是否由有理分式组成,并计算该密度。对于任意有限二次数集合,我们构造了一种连分数算法,其不变密度为包含这些二次数的有理分式。

英文摘要:

We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm that computes exact invariant densities of certain continued fraction algorithms, including classical ones and some of their extensions. For finite extensions of the classical additive algorithm with two coordinates, we provide a more precise algorithm that decides whether the invariant density is composed of rational fractions and computes it. For any finite set of quadratic numbers, we construct a continued fraction algorithm whose invariant density are rational fractions containing the quadratic numbers.

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

↑