Search arXivSearch

arXiv · 2209.04809

Euclidean ideal classes in Galois number fields of odd prime degree

Abstract

Weinberger in 1972, proved that the ring of integers of a number field with unit rank at least $1$ is a principal ideal domain if and only if it is a Euclidean domain, provided the generalised Riemann hypothesis holds. Lenstra extended the notion of Euclidean domains in order to capture Dedekind domains with finite cyclic class group and proved an analogous theorem in this setup. More precisely, he showed that the class group of the ring of integers of a number field with unit rank at least $1$ is cyclic if and only if it has a Euclidean ideal class, provided the generalised Riemann hypothesis holds. The aim of this paper is to show the following. Suppose that $\mathbf{K}_1$ and $\mathbf{K}_2$ are two Galois number fields of odd prime degree with cyclic class groups and Hilbert class fields that are abelian over $\mathbb{Q}$. If $\mathbf{K}_1\mathbf{K}_2$ is ramified over $\mathbf{K}_i$, then at least one $\mathbf{K}_i$ ($i \in \{1,2\}$) must have a Euclidean ideal class.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. Kumar Murty, J. Sivaraman. 2022-09-11. Euclidean ideal classes in Galois number fields of odd prime degree. https://doi.org/10.1007/s40993-022-00344-7

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