Search arXivSearch

arXiv · 2402.11049

Minimal Subgroups of ${\rm GL}_2(\mathbb{Z}_{S})$

Abstract

Let $E$ be an elliptic curve over a number field $L$ and for a finite set $S$ of primes, let $ρ_{E,S} : {\rm Gal}(\overline{L}/L) \to {\rm GL}_{2}(\mathbb{Z}_{S})$ be the $S$-adic Galois representation. If $L \cap \mathbb{Q}(ζ_{n}) = \mathbb{Q}$ for all positive integers $n$ whose prime factors are in $S$, then $\det ρ_{E,S} : {\rm Gal}(\overline{L}/L) \to \mathbb{Z}_{S}^{\times}$ is surjective. We say that a finite index subgroup $H \subseteq {\rm GL}_{2}(\mathbb{Z}_{S})$ is minimal if $\det : H \to \mathbb{Z}_{S}^{\times}$ is surjective, but $\det : K \to \mathbb{Z}_{S}^{\times}$ is not surjective for any proper closed subgroup $K$ of $H$. We show that there are no minimal subgroups of ${\rm GL}_{2}(\mathbb{Z}_{S})$ unless $S = \{ 2 \}$, while minimal subgroups of ${\rm GL}_{2}(\mathbb{Z}_{2})$ are plentiful. We give models for all the genus $0$ modular curves associated to minimal subgroups of ${\rm GL}_{2}(\mathbb{Z}_{2})$, and construct an infinite family of elliptic curves over imaginary quadratic fields with bad reduction only at $2$ and with minimal $2$-adic image.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Harris Daniels, Jeremy Rouse. 2024-09-07. Minimal Subgroups of ${\rm GL}_2(\mathbb{Z}_{S})$. https://arxiv.org/abs/2402.11049

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