Related papers: Computing Dirichlet character sums to a power-full…

Let $m\ge 1$ be a rational integer. We give an explicit formula for the mean value $$\frac{2}{\phi(f)}\sum_{\chi (-1)=(-1)^m}\vert L(m,\chi )\vert^2,$$ where $\chi$ ranges over the $\phi (f)/2$ Dirichlet characters modulo $f>2$ with the…

We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…

This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…

We prove a Voronoi formula for coefficients of a large class of $L$-functions including Maass cusp forms, Rankin-Selberg convolutions, and certain isobaric sums. Our proof is based on the functional equations of $L$-functions twisted by…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…

We prove a closed character formula for the symmetric powers $S^N V(\lambda)$ of a fixed irreducible representation $V(\lambda)$ of a complex semi-simple Lie algebra $\mathfrak{g}$ by means of partial fraction decomposition. The formula…

The exact distribution of the square sum of Dirichlet random variables is given by two different univariate integral representations. Alternatively, three representations by orthogonal series with Jacobi or Legendre polynomials are derived.…

In this article, we obtain the analytic continuation of the multiple shifted Lucas zeta function, multiple Lucas $L$-function associated to Dirichlet characters and additive characters. We then compute a complete list of exact singularities…

The purpose of this paper is to study the special values of the standard $L$-functions for quaternionic modular forms using the doubling method. We obtain an integral representation for the $L$-function twisted by a character and construct…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

We present some monotonicity results for Dirichlet $L$-functions associated to real primitive characters. We show in particular that these Dirichlet $L$-functions are far from being logarithmically completely monotonic. Also, we show that,…

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

We deal with negative square moments of Dirichlet $L$-functions. Summing over characters modulo $q$, we obtain an asymptotic formula for the negative second moment of $L(1,\chi)$ involving conductors. As an application, we give the improved…

We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

The Landau-Selberg-Delange method gives precise asymptotic formulas for the partial sums $\sum_{n \le x} \, a_n$ of a Dirichlet series $\sum_n \, a_n/n^s$ that behaves like a complex power of the Riemann zeta function. However, situations…