Search arXivSearch

arXiv · 1711.04813

Torsion for abelian varieties of type III

Abstract

Let $A$ be an abelian variety defined over a number field $K$. The number of torsion points that are rational over a finite extension $L$ is bounded polynomially in terms of the degree $[L:K]$ of $L$ over $K$. Under the following three conditions, we compute the optimal exponent for this bound, in terms of the dimension of abelian subvarieties and their endomorphism rings. The three hypothesis are the following: $(1)$ $A$ is geometrically isogenous to a product of simple abelian varieties of type I, II or III, according to the Albert classification; $(2)$ $A$ is of "Lefschetz type", that is, the Mumford-Tate group is the group of symplectic or orthogonal similitudes which commute with the endomorphism ring; $(3)$ $A$ satisfies the Mumford-Tate conjecture. This result is unconditional for a product of simple abelian varieties of type I, II or III with specific relative dimensions. Further, building on work of Serre, Pink, Banaszak, Gajda and Krasoń, we also prove the Mumford-Tate conjecture for a few new cases of abelian varieties of Lefschetz type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victoria Cantoral-Farfán. 2019-05-10. Torsion for abelian varieties of type III. https://doi.org/10.1016/j.jnt.2018.10.017

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