Search arXivSearch

arXiv · 1812.02797

Constructing Certain Special Analytic Galois Extensions

Abstract

For every prime $p\geq 5$ for which a certain condition on the class group $\text{Cl}(\mathbb{Q}(μ_p))$ is satisfied, we construct a $p$-adic analytic Galois extension of the infinite cyclotomic extension $\mathbb{Q}(μ_{p^{\infty}})$ with some special ramification properties. In greater detail, this extension is unramified at primes above $p$ and tamely ramified above finitely many rational primes and is isomorphic to a finite index subgroup of $\text{SL}_2(\mathbb{Z}_p)$ which contains the principal congruence subgroup. For the primes $107,139,271$ and $379$ such extensions were first constructed by Ohtani and Blondeau. The strategy for producing these special extensions at an abundant number of primes is through lifting two-dimensional reducible Galois representations which are diagonal when restricted to $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2019-07-11. Constructing Certain Special Analytic Galois Extensions. https://doi.org/10.1016/j.jnt.2019.10.023

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