Search arXivSearch

arXiv · 1805.05438

Dihedral Universal Deformations

Abstract

This article deals with universal deformations of dihedral representations with a particular focus on the question when the universal deformation is dihedral. Results are obtained in three settings: (1) representation theory, (2) algebraic number theory, (3) modularity. As to (1), we prove that the universal deformation is dihedral if all infinitesimal deformations are dihedral. Concerning (2) in the setting of Galois representations of number fields, we give sufficient conditions to ensure that the universal deformation relatively unramified outside a finite set of primes is dihedral, and discuss in how far these conditions are necessary. As side-results, we obtain cases of the unramified Fontaine-Mazur conjecture, and in many cases positively answer a question of Greenberg and Coleman on the splitting behaviour at p of p-adic Galois representations attached to newforms. As to (3), we prove a modularity theorem of the form `R=T' for parallel weight one Hilbert modular forms for cases when the minimal universal deformation is dihedral.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shaunak V. Deo, Gabor Wiese. 2020-04-09. Dihedral Universal Deformations. https://arxiv.org/abs/1805.05438

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