Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.05393

Calculating relative power integral bases in totally complex quartic extensions of totally real fields

István Gaál
View original source ↗Read source document ↗Export metadata ↓

Abstract

Some time ago we extended our monogenity investigations and calculations of generators of power integral bases to the relative case. Up to now we considered (usually totally real) extensions of complex quartic fields. In the present paper we consider power integral bases in relative extensions of totally real fields. Totally complex quartic extensions of totally real number fields seems to be the most simple case, that we detail here. As we shall see, even in this case we have to overcome several unexpected difficulties, which we can, however solve by properly (but not trivially) adjusting standard methods. We demonstrate our general algorithm on an explicit example. We describe how the general methods for solving relative index form equations in quartic relative extensions are modified in this case. As a byproduct we show that relative Thue equations in totally complex extensions of totally real fields can only have small solutions, and we construct a special method for the enumeration of small solutions of special unit equations. These statements can be applied to other diophantine problems, as well.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

István Gaál. 2020-04-11. Calculating relative power integral bases in totally complex quartic extensions of totally real fields. https://doi.org/10.17654/nt044020129

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↗