Search arXivSearch

arXiv · 2505.14150

Digit expansions in rational and algebraic basis

Abstract

Consider $α\in \Q(i)$ satisfying $|α| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $α$. We introduce a way of expanding complex numbers in base $α$ with digits in $\D$ that we call $α$-expansions, which generalize rational base number systems introduced by Akiyama, Frougny and Sakarovitch, and are related to rational self-affine tiles introduced by Steiner and Thuswaldner. We define an algorithm to obtain the expansions for certain Gaussian integers and show results on the language. We then extend the expansions to all $x \in \C$ (or $x \in \R$ when $α= \ab \in \Q$, the rational case will be our starting point) and show that they are unique almost everywhere. We relate them to tilings of the complex plane. We characterize $α$-expansions in terms of $p$-adic completions of $\Q(i)$ with respect to Gaussian primes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucía Rossi. 2025-05-20. Digit expansions in rational and algebraic basis. https://arxiv.org/abs/2505.14150

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

KEEP EXPLORING

Related papers

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

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