Related papers: Computing p-adic heights on hyperelliptic curves
We define a new canonical height pairing on the rational points of elliptic curves over global function fields which takes values in the multiplicative group of a completion of the function field. This height serves as an analogue of both…
We establish a valuative version of Grothendieck's section conjecture for curves over p-adic local fields. The image of every section is contained in the decomposition subgroup of a valuation which prolongs the p-adic valuation to the…
A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…
We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…
In this paper, a theory of hyperelliptic functions based on multidimensional sigma functions is developed and explicit formulas for hyperelliptic solutions to the Kadomtsev-Petviashvili equations KP-I and KP-II are obtained. The…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…
We prove two transformations for the $p$-adic hypergeometric functions which can be described as $p$-adic analogues of a Euler's transformation and a transformation of Clausen. We first evaluate certain character sums, and then relate them…
We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is…
Coleman calculated the absolute Frobenius on Fermat curves explicitly. In this paper we show that a kind of $p$-adic continuity implies a large part of his formula. To do this, we study a relation between functional equations of the…
We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.
We compute the conductor exponents at odd places using the machinery of cluster pictures of curves for three infinite families of hyperelliptic curves. These are families of Frey hyperelliptic curves constructed by Kraus and Darmon in the…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…
We propose a conjectural construction of global points on modular elliptic curves over arbitrary number fields, generalizing both the p-adic construction of Heegner points via Cerednik-Drinfeld uniformization and the definition of classical…
In this paper, we complete Jantzen's algorithm to compute the highest derivatives of irreducible representations of $p$-adic odd special orthogonal groups or symplectic groups. As an application, we give some examples of the Langlands data…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…