English
Related papers

Related papers: Estimates for short character sums evaluated at ho…

200 papers

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

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

General Mathematics · Mathematics 2012-05-25 N. A. Carella

We establish a central limit theorem of $(1/\sqrt{h_p})\sum_{X< n \leq X+h_p}\big(\tfrac{n}{p}\big)$ for almost all the primes $p$, with $X$ uniformly random in $[g(p)]$, $g(p)$ an arbitrary divergent function growing slower than any power…

Number Theory · Mathematics 2025-12-03 Paweł Nosal

Under the generalized Lindel\"of Hypothesis in the t- and q-aspects, we bound exponential sums with coefficients of Dirichlet series belonging to a certain class. We use these estimates to establish a conditional result on squares of Hecke…

Number Theory · Mathematics 2011-09-13 Stephan Baier

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

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…

Number Theory · Mathematics 2015-04-08 Jonathan Bober , Leo Goldmakher

We consider character sums determined by isogenies of elliptic curves over finite fields. We prove a congruence condition for character sums attached to arbitrary cyclic isogenies, and produce explicit formulas for isogenies of small…

Number Theory · Mathematics 2013-02-11 Dustin Moody , Christopher Rasmussen

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

Number Theory · Mathematics 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…

Optimization and Control · Mathematics 2025-01-16 Monique Laurent , Lucas Slot

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…

Number Theory · Mathematics 2017-06-12 Elijah Fromm , Leo Goldmakher

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

Number Theory · Mathematics 2017-03-16 Marc Munsch , Tim Trudgian

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…

Number Theory · Mathematics 2014-05-21 Mei-Chu Chang , Igor E. Shparlinski

For $1< p <2$ we obtain sharp inequalities for the supremum of products of homogeneous polynomials on $L_p(\mu)$, whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in the…

Functional Analysis · Mathematics 2013-04-22 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

Let $p$ denote an odd prime. In this paper, we are concerned with the $p$-divisibility of additive exponential sums associated to one variable polynomials over a finite field of characteristic $p$, and with (the very close question of)…

Number Theory · Mathematics 2015-02-04 Régis Blache

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

Number Theory · Mathematics 2014-10-15 Bryce Kerr

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 obtain lower bounds for the maximum dimension of a simple FG-module, where G is a finite group and F is an algebraically closed field of characteristic p. The bounds are described in terms of properties of p-subgroups of G. When p is 2…

Group Theory · Mathematics 2020-08-11 Geoffrey R. Robinson

We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…

Number Theory · Mathematics 2016-11-24 Igor E. Shparlinski , Ana Zumalacárregui

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

Number Theory · Mathematics 2016-12-30 André LeClair