English
Related papers

Related papers: Three conjectures about character sums

200 papers

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Number Theory · Mathematics 2012-03-02 Jean Bourgain , Moubariz Garaev , Sergei Konyagin , Igor Shparlinski

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

Number Theory · Mathematics 2019-09-04 Matteo Bordignon , Bryce Kerr

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

Number Theory · Mathematics 2015-07-06 Daqing Wan , Qiang Wang

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…

Number Theory · Mathematics 2007-05-23 David Terhune

We establish the restricted sumset analogue of the celebrated conjecture of S\'{a}rk\"{o}zy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the…

Number Theory · Mathematics 2026-04-22 Chi Hoi Yip

We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.

Number Theory · Mathematics 2013-07-10 Joshua Zelinsky

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

Probability · Mathematics 2021-03-02 Dimitrios Katselis , Xiaotian Xie , Carolyn L. Beck , R. Srikant

n 1937 Ivan Vinogradov proved the three prime sum version of the Goldbach Conjecture, often called the weak form of Goldbach Conjecture. And that it holds for "sufficiently large" odd natural numbers. In this work we use Dirichlet Theorem,…

General Mathematics · Mathematics 2021-12-21 Uboho Unyah

In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…

Combinatorics · Mathematics 2025-05-08 Julien Bensmail , Beatriz Martins , Chaoliang Tang

We define a new relation between character triples and prove some Clifford theory properties for weights in terms of character triples.

Representation Theory · Mathematics 2025-02-04 Zhicheng Feng

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

Combinatorics · Mathematics 2016-12-13 Mathias Pétréolle

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

Number Theory · Mathematics 2020-07-15 Youness Lamzouri

We apply multigrade efficient congruencing to estimate Vinogradov's integral of degree $k$ for moments of order $2s$, establishing strongly diagonal behaviour for $1\le s\le \frac{1}{2}k(k+1)-\frac{1}{3}k+o(k)$. In particular, as…

Number Theory · Mathematics 2019-02-20 Trevor D. Wooley

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

Combinatorics · Mathematics 2025-12-23 Saieed Akbari , Clive Elphick , Hitesh Kumar , Shivaramakrishna Pragada , Quanyu Tang

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…

Number Theory · Mathematics 2026-04-09 Larry Guth , James Maynard

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever…

Number Theory · Mathematics 2026-04-17 Aishik Chattopadhyay

A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…

Number Theory · Mathematics 2014-02-26 Cam McLeman , Christopher Rasmussen

In their recent work, the authors (2016) have combined classical ideas of A. G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli. In the…

Number Theory · Mathematics 2018-02-01 William D. Banks , Igor E. Shparlinski

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

Combinatorics · Mathematics 2025-09-09 Sheila Sundaram

We obtain finite field analogues of a series of recent results on various mean value theorems for Weyl sums. Instead of the Vinogradov Mean Value Theorem, our results rest on the classical argument of Mordell, combined with several other…

Number Theory · Mathematics 2025-03-17 Doowon Koh , Igor E. Shparlinski