Related papers: Large quadratic character sums

In this article, we study the distribution of large quadratic character sums. Based on the recent work of Lamzouri~\cite{La2022}, we obtain the structure results of quadratic characters with large character sums.

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

For a given Dirichlet character $\chi (n) = e^{i \theta_n}$, we prove central limit theorems for the series $\sum_{p'} \cos \theta_{p'}$ for non-principal characters, and $\sum_{p' } \cos (t \log p')$ for principal characters, where $p'$…

We consider moments of higher powers of quadratic Dirichlet character sums. In a restricted region, we give their asymptotic behavior by using de la Bret\`{e}che's multivariable Tauberian theorem. We also give the lower bound of the…

The main question of this paper is the following: how much cancellation can the partial sums restricted to the $k$-free integers up to $x$ of a $\pm 1$ multiplicative function $f$ be in terms of $x$? Building upon the recent paper by Q.…

We formulate and prove a large sieve inequality for quadratic characters over a number field. To do this, we introduce the notion of an n-th order Hecke family. We develop the basic theory of these Hecke families, including versions of the…

The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…

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…

In this paper, we obtain under the assumption of the Generalized Riemann Hypothesis upper bounds for all high integral moments of sums of Fourier coefficients of a given modular form twisted by quadratic Dirichlet characters. We show the…

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

We evaluate the average of cubic and quartic Dirichlet character sums with the modulus going up to a size comparable to the length of the individual sums. This generalizes a result of Conrey, Farmer and Soundararajan on quadratic Dirichlet…

We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.

In this paper, we investigate the conditional large values of the quadratic Dirichlet $L$-functions near the central point $s=1/2$. When $\sigma $ closes to $1/2$ within a suitable range, we show that $L(\sigma, \chi_d)$ have the…

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

We establish upper bounds for shifted moments of cubic and quartic Dirichlet $L$-functions under the generalized Riemann hypothesis. As an application, we prove bounds for moments of cubic and quartic Dirichlet character sums.

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 apply the resonance method to obtain large values of general exponential sums with positive coefficients. As applications, we show improved $\Omega$-bounds for Dirichlet and Piltz divisor problems, Gauss circle Problem, and error term…

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 prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…