Related papers: Computing central values of $L$-functions
We use the Asymptotic Large Sieve and Levinson's method to obtain lower bounds for the proportion of simple zeros on the critical line of the twists by primitive Dirichlet characters of a fixed L-function of degree 1,2, or 3.
This is a survey of recent progress on understanding the value distribution of zeta and L-functions. The article is intended for the 2022 ICM.
In this paper formulas are derived for the analytic center of the solution set of linear matrix inequalities (LMIs) defining passive transfer functions. The algebraic Riccati equations that are usually associated with such systems are…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
We state and analyze a generalization of the "truncation trick" suggested by Gourdon and Sebah to improve the performance of power series evaluation by binary splitting. It follows from our analysis that the values of D-finite functions…
The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our production machine learning system built on n-gram features, we ask:…
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straightforward classical MM to log 2 (7) $\approx$ 2.8074.…
In order to analyze spectrum from the interstellar medium (ISM), spectrum of the molecule of interest is recorded in a laboratory, and accurate rotational and centrifugal distortion constants are derived. By using these constants, one can…
The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…
Assuming the Generalized Riemann Hypothesis, we provide explicit upper bounds for moduli of $\log{\mathcal{L}(s)}$ and $\mathcal{L}'(s)/\mathcal{L}(s)$ in the neighbourhood of the 1-line when $\mathcal{L}(s)$ are the Riemann, Dirichlet and…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
We study the nonvanishing of twists of automorphic L-functions at the centre of the critical strip. Given a primitive character \chi modulo D satisfying some technical conditions, we prove that the twisted L-functions L(f.\chi,s) do not…
We study the number of meromorphic functions on a Riemann surface with given critical values and prescribed multiplicities of critical points and values. When the Riemann surface is $\CP^1$ and the function is a polynomial, we give an…
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 propose a numerical method for approximating and discovering zeros of the Dirichlet L-function L(s, chi) corresponding to real Dirichlet characters chi.
In this note we investigate the behavior at the central point of the symmetric square $L$-functions, the most frequently used $\rm{GL}(3)$ $L$-functions. We establish an asymptotic formula with arbitrary power saving for the first moment of…
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation…
We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case…