Search arXivSearch

arXiv · 1802.08329

Selmer groups of symmetric powers of ordinary modular Galois representations

Abstract

Let $p$ be a fixed odd prime number, $μ$ be a Hida family over the Iwasawa algebra of one variable, $ρ_μ$ its Galois representation, $\mathbb{Q}_\infty/\mathbb{Q}$ the $p$-cyclotomic tower and $S$ the variable of the cyclotomic Iwasawa algebra. We compare, for $n\leq 4$ and under certain assumptions, the characteristic power series $L(S)$ of the dual of Selmer groups $\mathrm{Sel}(\mathbb{Q}_{\infty},\mathrm{Sym}^{2n}\otimes\mathrm{det}^{-n}ρ_μ)$ to certain congruence ideals. The case $n=1$ has been treated by H.Hida. In particular, we express the first term of the Taylor expansion at the trivial zero $S=0$ of $L(S)$ in terms of an $\mathcal{L}$-invariant and a congruence number. We conjecture the non-vanishing of this $\mathcal{L}$-invariant; this implies therefore that these Selmer groups are cotorsion. We also show that our $\mathcal{L}$-invariants coincide with Greenberg's $\mathcal{L}$-invariants calculated by R.Harron and A.Jorza.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoyu Zhang. 2018-02-22. Selmer groups of symmetric powers of ordinary modular Galois representations. https://doi.org/10.1353/ajm.2021.0002

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