Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2308.12523

Arithmetical independence of certain uniform sets of algebraic integers

Asaki Saito·Jun-ichi Tamura·Shin-ichi Yasutomi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here, ``almost uniformity'' means that the elements of a finite set are distributed almost equidistantly in the unit interval, while ``arithmetical independence'' means that the number fields generated by the elements of a set do not have a mutual inclusion relation each other. Furthermore, we reveal to what extent the algebraic number fields generated by the elements of the four sets can cover quadratic or cubic fields.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Asaki Saito, Jun-ichi Tamura, Shin-ichi Yasutomi. 2023-08-24. Arithmetical independence of certain uniform sets of algebraic integers. https://arxiv.org/abs/2308.12523

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↗