Related papers: Character sums to smooth moduli are small

We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.

We obtain non-trivial bounds for bilinear sums of trace functions below the P\'olya-Vinogradov range assuming only that the geometric monodromy group of the underlying ell-adic sheaf satisfies certain simple structural properties, in…

We provide a new hybrid estimation of single exponential sums, combining Van der Corput, Huxley and Bourgain's result. We also focus on primes in short intervals $(x-x^{\alpha},x]$ under the assumption of the existence of exceptional…

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

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…

We slightly improve Garaev's recent sum-product estimate largely by using Plunneke's inequality a little more efficiently. We improve the exponent from 15/14 to 14/13.

We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…

A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…

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

Motivated by Emmanuel Kowalski's exponential sums over definable sets in finite fields, we generalize Ax's theorem on pseudo-finite fields to a continuous-logic setting allowing for an additive character. The role played by Weil's Riemann…

We generalize a method of Conrey and Ghosh (Invent. Math. 94 (1988)) to prove quantitative estimates for simple zeros of modular form L-functions of arbitrary conductor.

We present a conjecture (and a proof for G=SL(2)) generalizing a result of J. Arthur which expresses a character value of a cuspidal representation of a $p$-adic group as a weighted orbital integral of its matrix coefficient. It also…

We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained…

We study a spectral problem related to the finite-dimensional characters of the groups $Sp(2N)$, $SO(2N+1)$, and $SO(2N)$, which form the classical series $C$, $B$, and $D$, respectively. The irreducible characters of these three series are…

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 study character varieties arising as moduli of representations of an orientable surface group into a reductive group $G$. We first show that if $G/Z$ acts freely on the representation variety, then both the representation variety and the…

Kerov considered the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as a polynomial in free cumulants. Biane has proved that this polynomial has integer coefficients, and made various…

Using the results of Meyer and Solleveld on the resolutions of Schneider and Stuhler, we compute the character of every smooth representation of finite length and of depht 0 of a p-adic group. We prove that, in every strongly regular…

We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli $M=pl$, where $p$ and $l$ are primes, with prescribed bit patterns. We are now able to…