Related papers: Computing central values of $L$-functions
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 prove an approximate functional equation for the central value of the L-series attached to an irreducible cuspidal automorphic representation of GL(m) over a number field with unitary central character. We investigate the decay rate of…
We present an efficient algorithm for computing certain special values of Rankin triple product $p$-adic L-functions and give an application of this to the explicit construction of rational points on elliptic curves.
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
We describe algorithms for computing central values of twists of $L$-functions associated to Hilbert modular forms, carry out such computations for a number of examples, and compare the results of these computations to some heuristics and…
In the present paper, we study large values of Dirichlet $L$- functions inside the critical strip. For every $1/2<\sigma<1$, we show that for $q$ sufficiently large, there exists a non-principal character $\chi$ modulo $q$ and a constant…
We present an algorithm to compute values L(s) and derivatives of L-functions of motivic origin numerically to required accuracy. Specifically, the method applies to any L-series whose Gamma-factor is a product of any number of…
We prove several results on the distribution of values of $L$-functions at the edge of the critical strip, by constructing and studying a large class of random Euler products. Among new applications, we study families of symmetric power…
We study the moments of the Dirichlet L-function when defined over the polynomial ring over finite fields. We find an asymptotic formula to the fourth moment of the central value of Dirichlet L functions in this context. We also find a…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
We calculate the first and second moments of L-functions in the family of quadratic twists of a fixed elliptic curve E over F_q[x], asymptotically in the limit as the degree of the twists tends to infinity. We also compute moments involving…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…
We introduce a "resonance" method to produce large values of $|\zeta(1/2+it)|$ and large and small central values of $L$-functions.
An algorithm to compute Dirichlet $L$-functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
We combine the relative trace formula with analytic methods to obtain zero density estimate for $L$-functions in various families of automorphic representations for $\mathrm{GL}(m)$. Applications include strong bounds for the average…
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in…
We establish asymptotic formulae for the first and second moments of quadratic Dirichlet $L$--functions, at the centre of the critical strip, associated to the real quadratic function field $k(\sqrt{P})$ and inert imaginary quadratic…