Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.00051

Gaussian Behavior of Quadratic Irrationals

Eda Cesaratto·Brigitte Vallée
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the probabilistic behaviour of the continued fraction expansion of a quadratic irrational number, when weighted by some "additive" cost. We prove asymptotic Gaussian limit laws, with an optimal speed of convergence. We deal with the underlying dynamical system associated with the Gauss map, and its weighted periodic trajectories. We work with analytic combinatorics methods, and mainly with bivariate Dirichlet generating functions; we use various tools, from number theory (the Landau Theorem), from probability (the Quasi-Powers Theorem), or from dynamical systems: our main object of study is the (weighted) transfer operator, that we relate with the generating functions of interest. The present paper exhibits a strong parallelism with the methods which have been previously introduced by Baladi and Vallée in the study of rational trajectories. However, the present study is more involved and uses a deeper functional analysis framework.

Explore related subjects

math.NTmath.DSmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eda Cesaratto, Brigitte Vallée. 2020-09-14. Gaussian Behavior of Quadratic Irrationals. https://arxiv.org/abs/1708.00051

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↗