Search arXivSearch

arXiv · 0910.5080

Steinitz classes of tamely ramified Galois extensions of algebraic number fields

Abstract

The Steinitz class of a number field extension K/k is an ideal class in the ring of integers O_k of k, which, together with the degree [K:k] of the extension determines the O_k-module structure of O_K. We call rt(k,G) the classes which are Steinitz classes of a tamely ramified G-extension of k. We will say that those classes are realizable for the group G; it is conjectured that the set of realizable classes is always a group. We define A'-groups inductively, starting by abelian groups and then considering semidirect products of A'-groups with abelian groups of relatively prime order and direct products of two A'-groups. Our main result is that the conjecture about realizable Steinitz classes for tame extensions is true for A'-groups of odd order; this covers many cases not previously known. Further we use the same techniques to determine rt(k,D_n) for any odd integer n. In contrast with many other papers on the subject, we systematically use class field theory (instead of Kummer theory and cyclotomic descent).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandro Cobbe. 2009-10-27. Steinitz classes of tamely ramified Galois extensions of algebraic number fields. https://doi.org/10.1016/j.jnt.2009.12.004

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