Related papers: Computing the truncated theta function via Mordell…

It is often the case in Statistics that one needs to compute sums of infinite series, especially in marginalising over discrete latent variables. This has become more relevant with the popularization of gradient-based techniques (e.g.…

Let $C$ be a genus $2$ curve over $\mathbb{Q}$. Harvey and Sutherland's implementation of Harvey's average polynomial-time algorithm computes the $\bmod \ p$ reduction of the numerator of the zeta function of $C$ at all good primes $p\leq…

In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis.…

In this note, we show that the values of integrals of the log-tangent function with respect to any square-integrable function on $\left[0 , \frac{\pi}{2} \right]$ may be determined by a finite or infinite sum involving the Riemann…

The Riemann theta function is a complex-valued function of g complex variables. It appears in the construction of many (quasi-) periodic solutions of various equations of mathematical physics. In this paper, algorithms for its computation…

The suggested approach is based on a known representation of Dirichlet $L$-functions via the incomplete gamma functions. Some properties of the Taylor coefficients of the lower incomplete gamma function at infinity seem to be new.…

Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…

Denote by $\tau$ k (n), $\omega$(n) and $\mu$ 2 (n) the number of representations of n as product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the square-free integers, respectively. Let…

We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large…

This study presents explicit evaluations of the series \begin{equation*} \sum_{k=1}^\infty \frac{H_{k/n}^{(p)}}{k^q} \quad \text{and} \quad \sum_{k=1}^\infty \frac{(-1)^k H_{k/2n}^{(p)}}{k^q}, \quad p,q,n \in \mathbb{Z}_{\ge 1},\; q \ne 1,…

Let $x\ge 2$. The $\psi$-form of the prime number theorem is $\psi(x) =\sum\sb{n \le x}\Lambda(n) =x +O\bigl(x\sp{1-H(x)} \log\sp{2} x\big)$, where $H(x)$ is a certain function of $x$ with $0< H(x) \le \tfrac{1}{2}$. Tur\'an proved in 1950…

Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in…

We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…

Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising…

We use a smoothed version of the explicit formula to find an approximation to the Riemann zeta function as a product over its nontrivial zeros multiplied by a product over the primes. We model the first product by characteristic polynomials…

We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…

Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function…

We study the problem of estimating the trace of a matrix $A$ that can only be accessed through matrix-vector multiplication. We introduce a new randomized algorithm, Hutch++, which computes a $(1 \pm \epsilon)$ approximation to $tr(A)$ for…

For the Tornheim double zeta function T(s1,s2,s3) of complex variables,we obtain its functional equations,which are new.Using the calculus of r-th order derivative of zeta(s,alpha) as a function of alpha(developed in author[7])as the…

Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded rank property of extreme points in the semidefinite cone, we…