English
Related papers

Related papers: Incomplete Gauss sums modulo primes

200 papers

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

We obtain estimates for Vinogradov's integral which for the first time approach those conjectured to be the best possible. Several applications of these new bounds are provided. In particular, the conjectured asymptotic formula in Waring's…

Number Theory · Mathematics 2012-08-13 Trevor D. Wooley

We prove a version of the Bombieri--Vinogradov Theorem with certain products of Gaussian primes as moduli, making use of their special form as polynomial expressions in several variables. Adapting Vaughan's proof of the classical…

Number Theory · Mathematics 2016-07-26 Karin Halupczok

Let $p$ be a prime, let $s \geq 3$ be a natural number and let $A \subseteq \mathbb{F}_p$ be a non-empty set satisfying $|A| \ll p^{1/2}$. Denoting $J_s(A)$ to be the number of solutions to the system of equations \[ \sum_{i=1}^{s} (x_i -…

Number Theory · Mathematics 2023-10-13 Samuel Mansfield , Akshat Mudgal

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

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

It is well known that the classical Gauss sum, normalized by the square-root number of terms, takes only finitely many values. If one restricts the range of summation to a subinterval, a much richer structure emerges. We prove a limit law…

Number Theory · Mathematics 2015-09-07 Emek Demirci Akarsu , Jens Marklof

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Number Theory · Mathematics 2018-11-05 Igor E. Shparlinski , Jose Felipe Voloch

A multiple Gauss sum is a complete multiple exponential sum twisted by Dirichlet characters. We prove a new bound for multiple Gauss sums and, as an application, improve previous results in the Birch--Goldbach problem. Let $F_1, \ldots, F_R…

Number Theory · Mathematics 2026-05-19 Jianya Liu , Sizhe Xie

We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", arXiv:2603.00768. In the present…

Number Theory · Mathematics 2026-04-07 Stephan Baier

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

Number Theory · Mathematics 2019-12-09 M. E. Changa , M. A. Korolev

This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.

Number Theory · Mathematics 2015-06-12 D. R. Heath-Brown , L. B. Pierce

We give a slight refinement to the process by which estimates for exponential sums are extracted from bounds for Vinogradov's mean value. Coupling this with the recent works of Wooley, and of Bourgain, Demeter and Guth, providing optimal…

Number Theory · Mathematics 2016-03-08 D. R. Heath-Brown

We develop a multigrade enhancement of the efficient congruencing method to estimate Vinogradov's integral of degree $k$ for moments of order $2s$, thereby obtaining near-optimal estimates for $\tfrac{5}{8}k^2<s\le k^2-k+1$. There are…

Number Theory · Mathematics 2022-11-21 Trevor D. Wooley

We show that the system of equations \begin{align*} \sum_{i=1}^s (x_i^j-y_i^j) = a_j \qquad (1 \le j \le k) \end{align*} has appreciably fewer solutions in the subcritical range $s < k(k+1)/2$ than its homogeneous counterpart, provided that…

Number Theory · Mathematics 2021-10-07 Julia Brandes , Kevin Hughes

We obtain explicit lower bounds on multiplicative order of elements that have more general form than finite field Gauss period. In a partial case of Gauss period this bound improves the previous bound of O.Ahmadi, I.E.Shparlinski and…

Number Theory · Mathematics 2010-12-21 Roman Popovych

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

Number Theory · Mathematics 2019-02-20 Igor E. Shparlinski

We establish various upper bounds on Type-I and Type-II shifted bilinear sums with Sali\'e sums modulo a large prime $q$. We use these bounds to study, for fixed integers $a,b\not \equiv 0 \bmod q$, the distribution ofsolutions to the…

Number Theory · Mathematics 2026-01-16 Igor E. Shparlinski , Yixiu Xiao

We establish an analogue of the classical Polya-Vinogradov inequality for $GL(2, \F_p)$, where $p$ is a prime. In the process, we compute the `singular' Gauss sums for $GL(2, \F_p)$. As an application, we show that the collection of…

Number Theory · Mathematics 2021-06-10 Satadal Ganguly , C. S. Rajan
‹ Prev 1 2 3 10 Next ›