Search arXivSearch

arXiv · 1912.09023

On the algebraic functional equation of the eigenspaces of mixed signed Selmer groups of elliptic curves with good reduction at primes above $p$

Abstract

Let $p$ be an odd prime number, and let $E$ be an elliptic curve defined over a number field which has good reduction at every prime above $p$. Under suitable assumptions, we prove that the $η$-eigenspace and the $\barη$-eigenspace of mixed signed Selmer group of the elliptic curve are pseudo-isomorphic. As a corollary, we show that the $η$-eigenspace is trivial if and only if the $\barη$-eigenspace is trivial. Our results can be thought as a reflection principle which relate an Iwasawa module in a given eigenspace with another Iwasawa module in a "reflected" eigenspace.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suman Ahmed, Meng Fai Lim. 2019-12-19. On the algebraic functional equation of the eigenspaces of mixed signed Selmer groups of elliptic curves with good reduction at primes above $p$. https://doi.org/10.1007/s10114-020-9556-1

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