相关论文: Computing central values of $L$-functions

In this paper, we study the moments of central values of Hecke $L$-functions associated with quadratic characters in $\mathbb{Q}(i)$ and $\mathbb{Q}(\omega)$ with $\omega = exp(2\pi i/3)$ and establish some quantitative non-vanishing result…

We investigate various mean value problems involving order three primitive Dirichlet characters. In particular, we obtain an asymptotic formula for the first moment of central values of the Dirichlet L-functions associated to this family,…

A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…

We calculate exact analytic expressions for the average cluster numbers $\langle k \rangle_{\Lambda_s}$ on infinite-length strips $\Lambda_s$, with various widths, of several different lattices, as functions of the bond occupation…

We prove an asymptotic formula for the second moment of automorphic L-functions of even weight and prime power level. The error term is estimated uniformly in all parameters: level, weight, shift and twist.

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…

In this work, we extend the fractional linear multistep methods in [C. Lubich, SIAM J. Math. Anal., 17 (1986), pp.704--719] to the tempered fractional integral and derivative operators in the sense that the tempered fractional derivative…

The calculation of one loop integrals at finite temperature requires the evaluation of certain series, which converge very slowly or can even be divergent. Here we review a new method, recently devised by the author, for obtaining…

This is the text of an introductory lecture delivered at the IHES summer school on motives in July, 2006.

In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We…

Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…

The efficient approximation of highly oscillatory integrals plays an important role in a wide range of applications. Whilst traditional quadrature becomes prohibitively expensive in the high-frequency regime, Levin methods provide a way to…

We obtain a formula for the $p$-adic valuation of weighted moments of central $L$-values of holomorphic cusp forms twisted by Dirichlet characters of order $p$. In some cases we give an arithmetic interpretation of the constants in the…

We describe an algorithm to evaluate all the complex branches of the Lambert W function with rigorous error bounds in interval arithmetic, which has been implemented in the Arb library. The classic 1996 paper on the Lambert W function by…

In this article, we study the second moment of cubic Dirichlet L-functions at the central point $s=1/2$ over the rational function field $\mathbb{F}_q(T)$, where $q$ is a power of an odd prime satisfying $q \equiv 2 \pmod{3}$. Our result…

We present a novel method for deciding whether a given n-dimensional ellipsoid contains another one (possibly with a different center). This method consists in constructing a particular concave function and deciding whether it has any value…

We study the second moment of the central values of quadratic twists of a modular $L$-function. Unconditionally, we obtain a lower bound which matches the conjectured asymptotic formula, while on GRH we prove the asymptotic formula itself.

We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…

We survey a number of different methods for computing $L(\chi,1-k)$ for a Dirichlet character $\chi$, with particular emphasis on quadratic characters. The main conclusion is that when $k$ is not too large (for instance $k\le100$) the best…

Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…