We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which previously known methods do not apply. In particular, in the case of multiplicative characters modulo a prime p¼ we break the barrier of p for ranges of individual variables.11 page(s
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds o...
This is a collection of mostly unrelated open questions, at various levels of difficulty, related to...
We establish upper bounds for multiplicative character sums with the function σg (n) which computes ...
AbstractWe give nontrivial bounds in various ranges for exponential sums of the form∑n∈S(x,y)exp(2π...
We give nontrivial bounds in various ranges for exponential sums of the form [equation omitted for f...
We derive two new upper bounds on the double multiplicative character sum over subgroups and interva...
We improve a recent result of B. Hanson [Estimates for character sums with various convolutions. Pre...
This thesis considers four distinct problems in the area of exponential and character sums. The stra...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
Let u? be an integer of multiplicative order t ? 1 modulo a prime p. Sums of the form Sf (p, t, a) =...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
Abstract. We give nontrivial bounds in various ranges for character sums of the form ∑ n∈S(x, y) χ(R...
We obtain upper bounds on the number of solutions to congruences of the type (x1 + s)... (xv + s) ≡ ...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds o...
This is a collection of mostly unrelated open questions, at various levels of difficulty, related to...
We establish upper bounds for multiplicative character sums with the function σg (n) which computes ...
AbstractWe give nontrivial bounds in various ranges for exponential sums of the form∑n∈S(x,y)exp(2π...
We give nontrivial bounds in various ranges for exponential sums of the form [equation omitted for f...
We derive two new upper bounds on the double multiplicative character sum over subgroups and interva...
We improve a recent result of B. Hanson [Estimates for character sums with various convolutions. Pre...
This thesis considers four distinct problems in the area of exponential and character sums. The stra...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
Let u? be an integer of multiplicative order t ? 1 modulo a prime p. Sums of the form Sf (p, t, a) =...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
summary:We consider inequalities between sums of monomials that hold for all p-Newton sequences. Thi...
Abstract. We give nontrivial bounds in various ranges for character sums of the form ∑ n∈S(x, y) χ(R...
We obtain upper bounds on the number of solutions to congruences of the type (x1 + s)... (xv + s) ≡ ...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds o...
This is a collection of mostly unrelated open questions, at various levels of difficulty, related to...
We establish upper bounds for multiplicative character sums with the function σg (n) which computes ...