Search arXivSearch

arXiv · 2301.05700

Applications of representation theory and of explicit units to Leopoldt's conjecture

Abstract

Let $L/K$ be a Galois extension of number fields and let $G=\mathrm{Gal}(L/K)$. We show that under certain hypotheses on $G$, for a fixed prime number $p$, Leopoldt's conjecture at $p$ for certain proper intermediate fields of $L/K$ implies Leopoldt's conjecture at $p$ for $L$. We also obtain relations between the Leopoldt defects of intermediate extensions of $L/K$. By applying a result of Buchmann and Sands together with an explicit description of units and a special case of the above results, we show that given any finite set of prime numbers $\mathcal{P}$, there exists an infinite family $\mathcal{F}$ of totally real $S_{3}$-extensions of $\mathbb{Q}$ such that Leopoldt's conjecture for $F$ at $p$ holds for every $F \in \mathcal{F}$ and $p \in \mathcal{P}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabio Ferri, Henri Johnston. 2026-03-23. Applications of representation theory and of explicit units to Leopoldt's conjecture. https://doi.org/10.1007/s40993-026-00717-2

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