相关论文: A P\'{o}lya--Vinogradov inequality for short chara…

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}…

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 new fully explicit constant for the P\'olya-Vinogradov inequality for squarefree modulus. Given a primitive character $\chi$ to squarefree modulus $q$, we prove the following upper bound \begin{align*} \left|…

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…

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…

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) =…

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…

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…

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

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…

Let $f(n)$ be a multiplicative function with $|f(n)|\leq 1, q$ be a prime number and $a$ be an integer with $(a, q)=1, \chi$ be a non-principal Dirichlet character modulo $q$. Let $\varepsilon$ be a sufficiently small positive constant, $A$…

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…

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 $$…

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…

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…

We establish a new bound for short character sums in finite fields, particularly over two-dimensional grids in $\mathbb{F}_{p^3}$ and higher-dimensional lattices in $\mathbb{F}_{p^d}$, extending an earlier work of Mei-Chu Chang on Burgess…

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

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…