Related papers: Computing Dirichlet character sums to a power-full…
We provide estimates for sums of the form \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\chi(a+b+c)\right|\] and \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\sum_{d\in D}\chi(a+b+cd)\right|\] when $A,B,C,D\subset \mathbb F_p$, the field…
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…
We study the moments of $L$-functions associated with primitive cusp forms, in the weight aspect. In particular, we obtain an asymptotic formula for the twisted moments of a \textit{long} Dirichlet polynomial with modular coefficients. This…
Let $\mathfrak{g}$ be a complex semisimple Lie algebra. We give a description of characters of irreducible Whittaker modules for $\mathfrak{g}$ with any infinitesimal character, along with a Kazhdan-Lusztig algorithm for computing them.…
Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…
Dirichlet-multinomial (DMN) distribution is commonly used to model over-dispersion in count data. Precise and fast numerical computation of the DMN log-likelihood function is important for performing statistical inference using this…
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.
In this paper we present a method to derive Pi(x) and other Arithemtical functions that can be generated by a Dirichlet series by variational principles,we use a variational method to determine the solution for a Fredholm integral equation…
We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…
One of the main features of eigenvalue matrix models is that the averages of characters are again characters, what can be considered as a far-going generalization of the Fourier transform property of Gaussian exponential. This is true for…
Let C(q,+) be the set of even, primitive Dirichlet characters (mod q). Using the mollifier method we show that L^{(k)}(1/2,chi) is not equal to zero for almost all the characters chi in C(q,+) when k and q are large. Here, L^{(k)}(s,chi) is…
In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.
In \cite{MR2221114}, B.~C.~Berndt and A.~Zaharescu introduced the twisted divisor sums associated with the Dirichlet character while studying the Ramanujan's type identity involving finite trigonometric sums and doubly infinite series of…
The average number of primitive quadratic Dirichlet characters of modulus n tends to a constant as n->infty. The same is true for primitive cubic characters. It is therefore surprising that, as n->infty, the average number of primitive…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…
We prove conjecturally sharp upper bounds for the Dirichlet character moments $\frac{1}{r-1} \sum_{\chi \; \text{mod} \; r} |\sum_{n \leq x} \chi(n)|^{2q}$, where $r$ is a large prime, $1 \leq x \leq r$, and $0 \leq q \leq 1$ is real. In…