Search arXivSearch

arXiv · 2312.01481

Nonvanishing of generalised Kato classes and Iwasawa main conjectures

Abstract

A construction due to Darmon--Rotger gives rise to generalised Kato classes $κ_p(E)$ in the $p$-adic Selmer group ${\rm Sel}(\mathbf{Q},V_pE)$ of elliptic curves $E/\mathbf{Q}$ of positive even analytic rank, where $p>3$ is any prime of good ordinary reduction for $E$. In some cases, their conjectured that $κ_p(E)\neq 0$ precisely when ${\rm Sel}(\mathbf{Q},V_pE)$ is two-dimensional. The first cases of this conjecture were obtained in a joint work of the author with M.-L. Hsieh. In this note we give a new proof of the implication \[ κ_p(E)\neq 0\quad\Longrightarrow\quad{\rm dim}_{\mathbf{Q}_p}{\rm Sel}(\mathbf{Q},V_pE)=2 \] established in op. cit., and show that the converse implication holds if \emph{and only if} the restriction map ${\rm loc}_p:{\rm Sel}(\mathbf{Q},V_pE)\rightarrow E(\mathbf{Q}_p)\hat\otimes\mathbf{Q}_p$ is nonzero. The present approach is an adaptation to the non-CM case of the method introduced by the author in the case of CM elliptic curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesc Castella. 2023-12-03. Nonvanishing of generalised Kato classes and Iwasawa main conjectures. https://arxiv.org/abs/2312.01481

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