English
Related papers

Related papers: Point counting for foliations over number fields

200 papers

We compute the Mordell-Weil groups of the modular Jacobian varieties of hyperelliptic modular curves $X_1(M, MN)$ over every number field which is the composition of quadratic fields. Also we prove criteria for the existence of elliptic…

Number Theory · Mathematics 2021-11-17 Koji Matsuda

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Number Theory · Mathematics 2017-09-27 Nicole Looper

Investigating a conjecture of Zannier, we study irreducible subvarieties of abelian schemes that dominate the base and contain a Zariski dense set of torsion points that lie on pairwise isogenous fibers. If everything is defined over the…

Number Theory · Mathematics 2022-07-21 Gabriel Andreas Dill

In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In…

Number Theory · Mathematics 2017-07-20 Jun Zhang , Qi Cheng

We give an alternative proof of Faltings's theorem (Mordell's conjecture): a curve of genus at least two over a number field has finitely many rational points. Our argument utilizes the set-up of Faltings's original proof, but is in spirit…

Number Theory · Mathematics 2019-10-29 Brian Lawrence , Akshay Venkatesh

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…

Number Theory · Mathematics 2016-01-15 David Kohel

We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…

Computational Complexity · Computer Science 2014-04-16 Jin-Yi Cai , Heng Guo , Tyson Williams

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

Number Theory · Mathematics 2020-03-27 Floris Vermeulen

We show that for all epsilon > 0, there is a constant C(epsilon) > 0 such that for all elliptic curves E defined over a number field F with j(E) in Q we have #E(F)[tors] \leq C(epsilon)[F:Q]^{5/2+epsilon}. We pursue further bounds on the…

Number Theory · Mathematics 2017-05-31 Pete L. Clark , Paul Pollack

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Algebraic Geometry · Mathematics 2025-06-09 Yifan Zhang , Joe Kileel

We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

Number Theory · Mathematics 2014-05-06 Wade Hindes

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Number Theory · Mathematics 2010-03-23 Bas Edixhoven , Jean-Marc Couveignes , Robin de Jong , Franz Merkl , Johan Bosman

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

Classical Analysis and ODEs · Mathematics 2017-08-03 Gal Binyamini

Consider a Jacobian elliptic surface $E \to C$ with a section $P$ of infinite order. Previous work of the first author and Urz\'ua over the complex numbers gives a bound on the number of tangencies between $P$ and a torsion section of $E$…

Algebraic Geometry · Mathematics 2025-08-12 Douglas Ulmer , José Felipe Voloch

It follows from the Grothendieck-Ogg-Shafarevich formula that the rank of an abelian variety (with trivial trace) defined over the function field of a curve is bounded by a quantity which depends on the genus of the base curve and on bad…

Number Theory · Mathematics 2025-10-03 Félix Baril Boudreau , Jean Gillibert , Aaron Levin

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

Number Theory · Mathematics 2016-02-18 Ruthi Hortsch

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…

Combinatorics · Mathematics 2007-05-23 Thorsten Theobald

We shall consider sections of an elliptic scheme $\mathcal{E}$ over a(n affine) base curve $B$, and study the points of $B$ where the section takes a torsion value. In particular, we shall relate the distribution in $B$ of these points with…

Algebraic Geometry · Mathematics 2019-12-06 Pietro Corvaja , Julian Demeio , David Masser , Umberto Zannier

We consider the problem of counting the number of varieties in a family over $\mathbb{Q}$ with a rational point. We obtain lower bounds for this counting problem for some families over $\mathbb{P}^1$, even if the Hasse principle fails. We…

Number Theory · Mathematics 2022-07-27 Daniel Loughran , Lilian Matthiesen