Related papers: Lower bounds on odd order character sums
We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less…
Following the work of Hildebrand we improve the Po'lya- Vinogradov inequality in a specific range, we also give a general result that shows its dependency on Burgess bound and at last we improve the range of validity for a special case of…
Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a prime number and $a$ be an integer with $(a,\,q)=1$, $\chi$ be a non-principal Dirichlet character modulo $q$. In this paper, we shall prove that $$…
We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…
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 prove an explicit version of Burgess' bound on character sums for composite moduli.
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.
We have derived explicit expressions for the sum rules of order one of the eigenvalues of the negative Laplacian on two dimensional domains of arbitrary shape. Taking into account the leading asymptotic behavior of these eigenvalues, as…
We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…
A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…
We prove that the average size of a mixed character sum $$\sum_{1\le n \le x} \chi(n) e(n\theta) w(n/x)$$ (for a suitable smooth function $w$) is on the order of $\sqrt{x}$ for all irrational real $\theta$ satisfying a weak Diophantine…
Let $q$ be a power of a prime $p$ and let $U(q)$ be a Sylow $p$-subgroup of a finite Chevalley group $G(q)$ defined over the field with $q$ elements. We first give a parametrization of the set $\text{Irr}(U(q))$ of irreducible characters of…
Let $R$ be a finite ring and define the hyperbola $H=\{(x,y) \in R \times R: xy=1 \}$. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following "square root law" bound holds with a constant $C>0$ for…
We obtain explicit lower bounds on multiplicative order of elements that have more general form than finite field Gauss period. In a partial case of Gauss period this bound improves the previous bound of O.Ahmadi, I.E.Shparlinski and…
In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…
We prove a result on the large deviations of the central values of even primitive Dirichlet $L$-functions with a given modulus. For $V\sim \alpha\log\log q$ with $0<\alpha<1$, we show that \begin{equation}\nonumber\frac{1}{\varphi(q)} \#…
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…