Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.08346

On periodicity of geodesic continued fractions

Hohto Bekki
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present some generalizations of Lagrange's theorem in the classical theory of continued fractions motivated by the geometric interpretation of the classical theory in terms of closed geodesics on the modular curve. As a result, for an extension $F/F'$ of number fields with rank one relative unit group, we construct a geodesic multi-dimensional continued fraction algorithm to "expand" any basis of $F$ over $\mathbb{Q}$, and prove its periodicity. Furthermore, we show that the periods describe the relative unit group. By developing the above argument adelically, we also obtain a $p$-adelic continued fraction algorithm and its periodicity for imaginary quadratic irrationals.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hohto Bekki. 2017-12-22. On periodicity of geodesic continued fractions. https://doi.org/10.1016/j.jnt.2017.01.003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗