English
Related papers

Related papers: An elementary approach to character sums over mult…

200 papers

In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Polya-Vinogradov…

Number Theory · Mathematics 2007-05-23 Andrew Granville , K. Soundararajan

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.

Number Theory · Mathematics 2014-03-13 Vincent Pigno , Chris Pinner , Joe Sheppard

We prove, in particular, that if A,G are two arbitrary multiplicative subgroups of the prime field f_p, |G| < p^{3/4} such that the difference A-A is contained in G then |A| \ll |\G|^{1/3+o(1)}. Also, we obtain that for any eps>0 and a…

Number Theory · Mathematics 2015-08-18 Ilya D. Shkredov

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…

Number Theory · Mathematics 2022-03-18 Adam J. Harper

We obtain new bounds on some trilinear and quadrilinear character sums, which are non-trivial starting from very short ranges of the variables. An application to an apparently new problem on oscillations of characters on differences between…

Number Theory · Mathematics 2025-03-20 Étienne Fouvry , Igor E. Shparlinski , Ping Xi

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[\alpha n + \beta] : n =1,2,... \}$, where $\alpha,\beta\in\R$, and $\alpha$ is irrational. Our bounds are nontrivial over the same short…

Number Theory · Mathematics 2007-05-23 William D. Banks , Igor E. Shparlinski

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…

Combinatorics · Mathematics 2011-06-07 Liangpan Li , Oliver Roche-Newton

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

Number Theory · Mathematics 2019-05-23 Alexander P. Mangerel

We prove an estimate for multi-variable multiplicative character sums over affine subspaces of $\mathbb A^n_k$, which generalize the well known estimates for both classical Jacobi sums and one-variable polynomial multiplicative character…

Number Theory · Mathematics 2021-06-11 Antonio Rojas-León

In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are…

Number Theory · Mathematics 2019-07-31 Doowon Koh , Mozhgan Mirzaei , Thang Pham , Chun-Yen Shen

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…

Number Theory · Mathematics 2014-05-09 Mei-Chu Chang

We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.

Number Theory · Mathematics 2021-12-01 Alexey Orlov

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

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Number Theory · Mathematics 2010-10-25 Leo Goldmakher

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

Representation Theory · Mathematics 2013-10-15 Mikhail V. Ignatyev

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Number Theory · Mathematics 2015-06-26 R. de la Breteche , T. D. Browning

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…

Number Theory · Mathematics 2017-01-09 Youness Lamzouri , Alexander P. Mangerel

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

Number Theory · Mathematics 2011-07-01 Youness Lamzouri

Let $G = {\rm U}(2m, {\mathbb F}_{q^2})$ be the finite unitary group, with $q$ the power of an odd prime $p$. We prove that the number of irreducible complex characters of $G$ with degree not divisible by $p$ and with Frobenius-Schur…

Representation Theory · Mathematics 2009-04-14 C. Ryan Vinroot