Related papers: A fast algorithm to compute the Ramanujan-Deninger…

The null-function $0(a):=0$, $\forall a\in $N, has Ramanujan expansions: $0(a)=\sum_{q=1}^{\infty}(1/q)c_q(a)$ (where $c_q(a):=$ Ramanujan sum), given by Ramanujan, and $0(a)=\sum_{q=1}^{\infty}(1/\varphi(q))c_q(a)$, given by Hardy…

We extend the results obtained by E. Ntienjem to all positive integers. Let $\EuFrak{N}$ be the subset of $\mathbb{N}$ consisting of $\,2^{\nu}\mho$, where $\nu$ is in $\{0,1,2,3\}$ and $\mho$ is a squarefree finite product of distinct odd…

For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…

This paper deals with the computation of the Lerch transcendent by means of the Gauss-Laguerre formula. An a priori estimate of the quadrature error, that allows to compute the number of quadrature nodes necessary to achieve an arbitrary…

We provide bounds for the sequence of eigenvalues $\{\lambda_i(\Omega)\}_i$ of the Dirichlet problem $$ L_\Delta u=\lambda u\ \ {\rm in}\ \, \Omega,\quad\quad u=0\ \ {\rm in}\ \ \mathbb{R}^N\setminus \Omega,$$ where $L_\Delta$ is the…

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…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

We consider the problem of approximating the girth, $g$, of an unweighted and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. A seminal result of Itai and Rodeh [SICOMP'78] gave an additive $1$-approximation in $O(n^2)$ time, and…

In this series, we investigate the calculation of mean values of derivatives of Dirichlet $L$-functions in function fields using the analogue of the approximate functional equation and the Riemann Hypothesis for curves over finite fields.…

We prove an exact formula for the variance of the divisor function over short intervals in $\mathcal{A} := \mathbb{F}_q [T]$, where $q$ is a prime power. A slight adaption of the proof allows us to obtain an exact formula for correlations…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N \alpha \le x} \mathfrak{t}_k(\alpha)$, where $N$ stands for the norm of a…

In this self-contained short note, we introduce the new definition of Good Ramanujan Expansion, say G.R.E., for a fixed arithmetic function $F$, building upon a good decay of its coefficients $G$; this, gains $\log-$powers w.r.t. the…

Cardinality-constrained binary optimization is a fundamental computational primitive with broad applications in machine learning, finance, and scientific computing. In this work, we introduce a Grover-based quantum algorithm that exploits…

Two quadrature-based algorithms for computing the matrix fractional power $A^\alpha$ are presented in this paper. These algorithms are based on the double exponential (DE) formula, which is well-known for its effectiveness in computing…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…

We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.

In this paper, a modified Euler-Maruyama (EM) method is constructed for a kind of multi-term Riemann-Liouville stochastic fractional differential equations and the strong convergence order min{1-{\alpha}_m, 0.5} of the proposed method is…

In this paper, I utilize a variant of the Selberg--Delange method to find quantitative estimates of the sums \[M_{k,\omega}(x,y)=\sum_{\substack{p_{1}(n)> y\\ n\leq x} } \mu(n) {\omega(n)-1\choose k-1},\] where $y$ can grow with $x$ but we…