English
Related papers

Related papers: Improved bounds on Gauss sums in arbitrary finite …

200 papers

We use an estimate of Aksoy Yazici, Murphy, Rudnev and Shkredov (2016) on the number of solutions of certain equations involving products and differences of sets in prime finite fields to give an explicit upper bound on trilinear…

Number Theory · Mathematics 2017-02-10 Giorgis Petridis , Igor E. Shparlinski

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

Number Theory · Mathematics 2023-12-05 Clemens Fuchs , Sebastian Heintze

We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim…

Combinatorics · Mathematics 2007-05-23 D. Hart , A. Iosevich , J. Solymosi

Let $q$ be a prime power and $r$ a positive even integer. Let $\mathbb{F}_{q}$ be the finite field with $q$ elements and $\mathbb{F}_{q^r}$ be its extension field of degree $r$. Let $\chi$ be a nontrivial multiplicative character of…

Number Theory · Mathematics 2025-05-12 Kaimin Cheng , Arne Winterhof

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

Number Theory · Mathematics 2013-02-19 Bryce Kerr

This is an expository account of the proof of the theorem of Bourgain, Glibichuk and Konyagin which provides non-trivial bounds for exponential sums over very small multiplicative subgroups of prime finite fields.

Number Theory · Mathematics 2024-01-30 Emmanuel Kowalski

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

Number Theory · Mathematics 2025-12-18 Andrés Chirre , Harald Andrés Helfgott

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

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

Number Theory · Mathematics 2011-11-22 Michele Elia , Davide Schipani

Let $\mathbb{F}_q$ denote the finite field with $q$ elements where $q=p^l$ is a prime power. Using Fourier analytic tools with a third moment method, we obtain sum-product type estimates for subsets of $\mathbb{F}_q$. In particular, we…

Combinatorics · Mathematics 2019-03-25 Esen Aksoy Yazici

We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

Algebraic Geometry · Mathematics 2015-12-31 Julia Pieltant , Hugues Randriam

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

In this paper we obtain a new sum-product estimate in prime fields. In particular, we show that if $A\subseteq \mathbb{F}_p$ satisfies $|A|\le p^{64/117}$ then $$ \max\{|A\pm A|, |AA|\} \gtrsim |A|^{39/32}. $$ Our argument builds on and…

Combinatorics · Mathematics 2018-07-31 Changhao Chen , Bryce Kerr , Ali Mohammadi

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if…

Number Theory · Mathematics 2009-07-14 Liangpan Li

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

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

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-29 Xiwang Cao , Lei Hu

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-26 Xiwang Cao , Lei Hu

We extend the classical Burgess estimates to character sums over proper generalized arithmetic progressions (GAPs) of rank $2$ in prime fields $\mathbb{F}_p$. The core of our proof is a sharp upper bound for the multiplicative energy of…

Number Theory · Mathematics 2026-01-06 Ali Alsetri , Xuancheng Shao