Related papers: Numerical Computations Concerning the GRH

"Murmurations" are a recently-discovered type of fine structure in sums of Dirichlet coefficients averaged over families of $L$-functions. The root cause of this phenomenon remains mysterious. In the present paper, we demonstrate how…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…

We derive several identities for the Hurwitz and Riemann zeta functions, the Gamma function, and Dirichlet $L$-functions. They involve a sequence of polynomials $\alpha_k(s)$ whose study was initiated in an earlier paper. The expansions…

In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…

We look at the values of two Dirichlet $L$-functions at the Riemann zeros (or a horizontal shift of them). Off the critical line we show that for a positive proportion of these points the pairs of values of the two $L$-functions are…

We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…

Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I,…

We give expressions for all generalized polylogarithms up to weight four in terms of the functions log, $\text{Li}_n$, and $\text{Li}_{2,2}$, valid for arbitrary complex variables. Furthermore we provide algorithms for manipulation and…

We prove a formula, with power savings, for the sixth moment of Dirichlet L-functions averaged over moduli $q$, over primitive characters $\chi$ modulo $q$, and over the critical line. Our formula agrees precisely with predictions motivated…

A fast new algorithm is used compute the zeros of the quadratic character L-functions for all negative fundamental discriminants with absolute value 10^12<d<10^12+10^7. These are compared to the 1-level density, including various lower…

We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…

We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

We prove an asymptotic for the eighth moment of Dirichlet $L$-functions averaged over primitive characters $\chi$ modulo $q$, over all moduli $q\leq Q$ and with a short average on the critical line, conditionally on GRH. We derive the…

Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.

For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…

We evaluate the first moment of central values of the family of quadratic Dirichlet $L$-functions using the method of double Dirichlet series. Under the generalized Riemann hypothesis, we prove an asymptotic formula with an error term of…

Let HN denote the problem of determining whether a system of multivariate polynomials with integer coefficients has a complex root. It has long been known that HN in P implies P=NP and, thanks to recent work of Koiran, it is now known that…

We give a fast algorithm for computing the canonical basis of an irreducible highest-weight module for $U_q(\hat{\mathfrak{sl}}_e)$, generalising the LLT algorithm.

We consider some properties of integrals considered by Hardy and Koshliakov, and which have also been further extended recently by Dixit. We establish a new general integral formula from some observations about the digamma function. We also…