Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates

1999 ◽  
Vol 32 (4) ◽  
pp. 453-466 ◽  
Author(s):  
F. Green
Keyword(s):  
Exponential Sums ◽  
Threshold Gate

scholarly journals A note on two-term exponential sum and the reciprocal of the quartic Gauss sums

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Wenpeng Zhang ◽  
Xingxing Lv
Keyword(s):  
Exponential Sums ◽  
Exponential Sum ◽  
Gauss Sums ◽  
Power Mean ◽  
Hybrid Power ◽  
Analytic Methods ◽  
Hybrid Power Mean

AbstractThe main purpose of this article is by using the properties of the fourth character modulo a prime p and the analytic methods to study the calculating problem of a certain hybrid power mean involving the two-term exponential sums and the reciprocal of quartic Gauss sums, and to give some interesting calculating formulae of them.

scholarly journals On Waring’s problem: Three cubes and a sixth power

2001 ◽  
Vol 163 ◽  
pp. 13-53 ◽  
Author(s):  
Jörg Brüdern ◽  
Trevor D. Wooley
Keyword(s):  
Exponential Sums ◽  
Large Integer ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Smooth Numbers ◽  
Waring's Problem ◽  
Order Of Magnitude ◽  
Almost All ◽  
Hardy Littlewood Method

We establish that almost all natural numbers not congruent to 5 modulo 9 are the sum of three cubes and a sixth power of natural numbers, and show, moreover, that the number of such representations is almost always of the expected order of magnitude. As a corollary, the number of representations of a large integer as the sum of six cubes and two sixth powers has the expected order of magnitude. Our results depend on a certain seventh moment of cubic Weyl sums restricted to minor arcs, the latest developments in the theory of exponential sums over smooth numbers, and recent technology for controlling the major arcs in the Hardy-Littlewood method, together with the use of a novel quasi-smooth set of integers.

Construction of systems of polynomial equations with exact p-Divisibility via the covering method

2014 ◽  
Vol 13 (06) ◽  
pp. 1450013 ◽  
Author(s):  
Francis N. Castro ◽  
Ivelisse M. Rubio
Keyword(s):  
Exponential Sums ◽  
Polynomial Equations ◽  
Prime Field ◽  
Elementary Method ◽  
Covering Method ◽  
Systems Of Polynomial Equations

We present an elementary method to compute the exact p-divisibility of exponential sums of systems of polynomial equations over the prime field. Our results extend results by Carlitz and provide concrete and simple conditions to construct families of polynomial equations that are solvable over the prime field.

Short cubic exponential sums over primes

2017 ◽  
Vol 296 (1) ◽  
pp. 211-233
Author(s):  
Z. Kh. Rakhmonov ◽  
F. Z. Rakhmonov
Keyword(s):  
Exponential Sums ◽  
Exponential Sums Over Primes

scholarly journals An improved Mordell type bound for exponential sums

2004 ◽  
Vol 133 (2) ◽  
pp. 313-320 ◽  
Author(s):  
Todd Cochrane ◽  
Christopher Pinner
Keyword(s):  
Exponential Sums
Sign in / Sign up

Export Citation Format

Share Document