Search arXivSearch

arXiv · 2012.08122

Constructing Galois representations ramified at one prime

Abstract

Let $n>1$, $e\geq 0$ and a prime number $p\geq 2^{n+2+2e}+3$, such that the index of regularity of $p$ is $\leq e$. We show that there are infinitely many irreducible Galois representations $ρ: Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow {GL}_n(\mathbb{Q}_p)$ unramified at all primes $l\neq p$. Furthermore, these representations are shown to have image containing a fixed finite index subgroup of ${SL}_n(\mathbb{Z}_p)$. Such representations are constructed by lifting suitable residual representations $\barρ$ with image in the diagonal torus in ${GL}_n(\mathbb{F}_p)$, for which the global deformation problem is unobstructed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anwesh Ray. 2021-06-05. Constructing Galois representations ramified at one prime. https://doi.org/10.1016/j.jnt.2020.12.005

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