Related papers: Algorithms for $p$-adic Heights on Hyperelliptic C…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
We introduce an algorithm that can be used to compute the canonical height of a point on an elliptic curve over the rationals in quasi-linear time. As in most previous algorithms, we decompose the difference between the canonical and the…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…
Let ${\mathrm G}$ be the group $({\rm GL}_{2}\times {\rm GU}(1))/{\rm GL}_{1}$ over a totally real field $F$, and let $\mathscr{X}$ be a Hida family for ${\rm G}$. Revisiting a construction of Howard and Fouquet, we construct an explicit…
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on…
In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of $p$-adic $L$-functions and have further been applied to compute rational…
In this paper, we prove a `cut-by-curves criterion' for the overconvergence of integrable connections on certain rigid analytic spaces and certain varieties over $p$-adic fields.
We continue our study of integral points on moduli schemes by combining the method of Faltings (Arakelov, Parsin, Szpiro) with modularity results and Masser-W\"ustholz isogeny estimates. In this work we explicitly bound the height and the…
Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…
Superspecial curves are important objects in number theory and algebraic geometry, and the existence in genus $g \geq 4$ remains an open problem for all but finitely many characteristics $p > 0$. As a computational approach to this problem,…
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…
We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
We construct smooth projective families of algebraic varieties in characteristic $p$ such that the dimensions of the de Rham and Hodge cohomology groups of the fibers can be made to jump by an arbitrarily large amount. To do this, we first…
In this article, we describe an efficient method for computing Teitelbaum's $p$-adic $\mathcal{L}$-invariant. These invariants are realized as the eigenvalues of the $\mathcal{L}$-operator acting on a space of harmonic cocycles on the…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…