Search arXivSearch

arXiv · 1907.06608

Effect of increasing the ramification on pseudo-deformation rings

Abstract

Given a continuous, odd, semi-simple $2$-dimensional representation of $G_{\mathbb{Q},Np}$ over a finite field of odd characteristic $p$ and a prime $\ell$ not dividing $Np$, we study the relation between the universal deformation rings of the corresponding pseudo-representation for the groups $G_{\mathbb{Q},N\ell p}$ and $G_{\mathbb{Q},Np}$. As a related problem, we investigate when the universal pseudo-representation arises from an actual representation over the universal deformation ring. Under some hypotheses, we prove analogues of theorems of Boston and Böckle for the reduced pseudo-deformation rings. We improve these results when the pseudo-representation is unobstructed and $p$ does not divide $\ell^2-1$. When the pseudo-representation is unobstructed and $p$ divides $\ell+1$, we prove that the universal deformation rings in characteristic $0$ and $p$ of the pseudo-representation for $G_{\mathbb{Q},N\ell p}$ are not local complete intersection rings. As an application of our main results, we prove a big $R=\mathbb{T}$ theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shaunak V. Deo. 2021-12-06. Effect of increasing the ramification on pseudo-deformation rings. https://arxiv.org/abs/1907.06608

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