Related papers: Transition mean values of real characters

In this paper, we evaluate a smoothed character sum involving $\sum_{m}\sum_{n}\leg {m}{n}$, with quadratic, cubic or quartic Hecke characters $\leg {m}{n}$, and the two sums over $m$ and $n$ are of comparable lengths.

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

Let f be a classical holomorphic cusp form for SL_2(Z) of weight k which is a normalized eigenfunction for the Hecke algebra, and let \lambda(n) be its eigenvalues. In this paper we study "shifted convolution sums" of the eigenvalues…

We study the double character sum $\sum\limits_{\substack{m\leq X,\\m\odd}}\sum\limits_{\substack{n\leq Y,\\n\odd}}\leg mn$ and its smoothly weighted counterpart. An asymptotic formula with power saving error term was obtained by Conrey,…

We study large values of quadratic character sums with summation lengths exceeding the square root of the modulus. Assuming the Generalized Riemann Hypothesis, we obtain a new Omega result.

We prove that Burgess's bound gives an estimate not just for a single character sum, but for a mean value of many such sums.

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

Let $q$ be a positive integer, $\chi$ a nontrivial character mod $q$, $\mathcal{I}$ an interval of length not exceeding $q.$ In this paper we shall study the character sum analogue of the well-known Kloosterman…

In this paper, we evaluate the sum $\sum_{m,n}\leg {m}{n}d(n)$, where $\leg {m}{n}$ is the Kronecker symbol and $d(n)$ is the divisor function.

We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any $b$ there…

Let $N$ be any fixed positive integer and define \begin{align*} S_N(x)=\sum_{m, n \leq x}d(n^2+Nm^2), \end{align*} where $d(n)$ is the divisor function. We evaluate asymptotically $S_N(x)$ for several $N$, extending earlier works of Gafurov…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

In this paper, we evaluate a smoothed sum of the form $\displaystyle \sideset{}{^*}\sum_{d \leq X}\left(\sum_{n \leq Y} \left(\frac{8d}{n} \right ) \right)^2$, where $\left ( \frac{8d}{\cdot} \right )$ is the Kronecker symbol and…

We study smoothed character sums involving $\sum_{m,n} ( \frac{m}{n} )_2$, where $( \frac{m}{n} )_2$ denotes the quadratic symbol in the Gaussian field. We extend previously known results to obtain asymptotic formulas for the sums…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We present an efficient algorithm for finding all approximate occurrences of a given pattern $p$ of length $m$ in a text $t$ of length $n$ allowing for translocations of equal length adjacent factors and inversions of factors. The algorithm…

In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang.…