Related papers: Computing p-adic heights on hyperelliptic curves

We extend the algorithm of Darmon-Green and Darmon-Pollack for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of Darmon-Logan for computing ATR Darmon points to treat…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

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…

We determine the quadratic Chabauty set for integral points on elliptic curves of rank $2$ defined over imaginary quadratic fields using quadratic Chabauty. This builds on the work of Bianchi and Balakrishnan et al. We give the first…

We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic…

We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds…

In the previous work, we introduced a method for constructing invariant probability measures of a large class of non-singular volume-preserving flows on closed, oriented odd-dimensional smooth manifolds with pseudoholomorphic curve…

In this note we combine the advantages of the methods of Siegel-Baker-Coates and of Lang-Zagier for the computation of S-integral points on elliptic curves in Weierstrass normal form over the rationals. In this way we are able to overcome…

Under suitable hypotheses, we construct a probability measure on the set of closed maximal isotropic subspaces of a locally compact quadratic space over F_p. A random subspace chosen with respect to this measure is discrete with probability…

Let $(M^n, g, e^{-f}dv)$ be a smooth metric measure space of dimensional $n$. Suppose that $v$ is a positive weighted $p$-eigenfunctions associated to the eigenvalues $\lambda_{1,p}$ on $M$, namely $$ e^{f}div(e^{-f}|\nabla v|^{p-2}\nabla…

For a fixed positive integer $e$, we describe an algorithm for computing, for all primes $p \leq X$, the mod-$p^e$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive over $\mathbb{Q}$ in time quasilinear in $X$.…

This paper considers the estimation of quantiles via a smoothed version of the stochastic gradient descent (SGD) algorithm. By smoothing the score function in the conventional SGD quantile algorithm, we achieve monotonicity in the quantile…

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

Stochastic gradient algorithms are more and more studied since they can deal efficiently and online with large samples in high dimensional spaces. In this paper, we first establish a Central Limit Theorem for these estimates as well as for…

This work develops polynomial-degree-robust (p-robust) equilibrated a posteriori error estimates for $H(\rm curl)$, $H(\rm div)$ and $H(\rm divdiv)$ problems, based on $H^1$ auxiliary space decomposition. The proposed framework employs…

We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…