Search arXivSearch

arXiv · 1809.10084

Integral bases and monogenity of pure fields

Abstract

Let $m$ be a square-free integer ($m\neq 0,\pm 1$). We show that the structure of the integral bases of the fields $K=Q(\sqrt[n]{m})$ are periodic in $m$. For $3\leq n\leq 9$ we show that the period length is $n^2$. We explicitly describe the integral bases, and for $n=3,4,5,6,8$ we explicitly calculate the index forms of $K$. This enables us in many cases to characterize the monogenity of these fields. Using the explicit form of the index forms yields a new technic that enables us to derive new results on monogenity and to get several former results as easy consequences. For $n=4,6,8$ we give an almost complete characterization of the monogenity of pure fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

István Gaál, László Remete. 2018-09-26. Integral bases and monogenity of pure fields. https://doi.org/10.1016/j.jnt.2016.09.009

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