Related papers: An explicit P\'{o}lya-Vinogradov inequality via Pa…

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

In this paper we obtain a variation of the P\'{o}lya--Vinogradov inequality with the sum restricted to a certain height. Assume $\chi$ to be a primitive character modulo $q$, $\epsilon > 0$ and $N\le q^{1-\gamma}$, with $0\le \gamma \le…

For a primitive Dirichlet character $\chi$ modulo $q$, we define $M(\chi)=\max_{t } |\sum_{n \leq t} \chi(n)|$. In this paper, we study this quantity for characters of a fixed odd order $g\geq 3$. Our main result provides a further…

Let $g \geq 3$ be fixed and odd, and for large $q$ let $\chi$ be a primitive Dirichlet character modulo $q$ of order $g$. Conditionally on GRH we improve the existing upper bounds in the P\'{o}lya-Vinogradov inequality for $\chi$, showing…

We show in a quantitative way that any odd character $\chi$ modulo $q$ of fixed order $g \geq 2$ satisfies the property that if the P\'{o}lya-Vinogradov inequality for $\chi$ can be improved to $$\max_{1 \leq t \leq q} \left|\sum_{n \leq t}…

We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

Let $\chi$ be a primitive character modulo a prime $q$, and let $\delta > 0$. It has previously been observed that if $\chi$ has large order $d \geq d_0(\delta)$ then $\chi(n) \neq 1$ for some $n \leq q^{\delta}$, in analogy with…

In this paper we obtain a new constant in the P\'{o}lya-Vinogradov inequality. Our argument follows previously established techniques which use the Fourier expansion of an interval to reduce to Gauss sums. Our improvement comes from…

It is well-known that cancellation in short character sums (e.g. Burgess' estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess' work, so it is desirable to find a new…

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

In this paper we proved a new numerically explicit version of the P\'{o}lya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequality obtained by C. Pomerance.

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…

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…

We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading constant in the P\'{o}lya-Vinogradov inequality. Towards…

We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…

A classical result of Paley shows that there are infinitely many quadratic characters $\chi\mod{q}$ whose character sums get as large as $\sqrt{q}\log \log q$; this implies that a conditional upper bound of Montgomery and Vaughan cannot be…

We investigate the sums $(1/\sqrt{H}) \sum_{X < n \leq X+H} \chi(n)$, where $\chi$ is a fixed non-principal Dirichlet character modulo a prime $q$, and $0 \leq X \leq q-1$ is uniformly random. Davenport and Erd\H{o}s, and more recently…

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…