Search arXivSearch

arXiv · 2407.20468

Global Galois Symbols on E x E

Abstract

Let E be an elliptic curve over a number field F, A the abelian surface E x E, and T_F(A) the F-rational albanese kernel of A, which is a subgroup of the degree zero part of Chow group of zero cycles on A modulo rational equivalence. The first result is that for all but a finite number of primes p where E has ordinary reduction, the image of T_F(A)/p in the Galois cohomology group H^2(F, sym^2(E[p])) is zero; here E[p] denotes as usual the Galois module of p-division points on E. The second result is that for any prime p where E has good ordinary reduction, there is a finite extension K of F, depending on p and E, such that T_K(A)/p is non-zero. Much of this work was joint with Jacob Murre, and the article is dedicated to his memory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dinakar Ramakrishnan. 2024-11-19. Global Galois Symbols on E x E. https://arxiv.org/abs/2407.20468

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