Related papers: Efficient computation of Rankin p-adic L-functions

We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two…

We construct multivariate p-adic L-function in the p-adic number fild by using Washington method.

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…

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

Restricting ourselves to elliptic curves over $\mathbb{Q}$, we reformulate the $p$-adic Beilinson conjecture due to Perrin-Riou, which is customized to our computational approach. We then develop a new algorithm for numerical verifications…

We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

We give an explicit description of the stable reduction of superelliptic curves of the form $y^n=f(x)$ at primes $\p$ whose residue characteristic is prime to the exponent $n$. We then use this description to compute the local $L$-factor of…

The L-function $ L(\rho_\lambda, s) $ of an almost everywhere unramified $ \lambda $-adic representation $ \rho_\lambda $ of a global function field $ \mathbb{F}_q(C) $ is known to be a rational function in $ q^{-s} $ satisfying a…

Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are imposed and certain poles are allowed, with some multiplicities…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…

In the paper we prove an explicit formula for the central values of certain Rankin L-functions. These L-functions are L-functions of Hilbert newforms over a totally real field F, twisted by unitary Hecke characters of a totally imaginary…

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…

Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…

In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…