scholarly journals Vinogradov's exponential sum over primes

2006 ◽  
Vol 124 (3) ◽  
pp. 269-285 ◽  
Author(s):  
Xiumin Ren
Keyword(s):  
Exponential Sum

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.

Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects

2015 ◽  
Vol 32 (04) ◽  
pp. 1550026 ◽  
Author(s):  
Yuan-Yuan Lu ◽  
Fei Teng ◽  
Zhi-Xin Feng
Keyword(s):  
Single Machine ◽  
Minimization Problem ◽  
Completion Time ◽  
Heuristic Algorithms ◽  
Exponential Sum ◽  
Total Weighted Completion Time ◽  
Learning Effects ◽  
Processing Times ◽  
Time Minimization ◽  
Weighted Completion Time

In this study, we consider a scheduling problem with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects on a single machine. We prove that the shortest processing time (SPT) rule is optimal for the makespan minimization problem, the sum of the θth power of job completion times minimization problem, and the total lateness minimization problem, respectively. For the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness minimization problem, we present heuristic algorithms (the worst-case bound of these heuristic algorithms are also given) according to the corresponding single machine scheduling problems without learning considerations. It also shows that the problems of minimizing the total tardiness, the total weighted completion time and the discounted total weighted completion time are polynomially solvable under some agreeable conditions on the problem parameters.

Upper bounds on a two-term exponential sum*

2001 ◽  
Vol 44 (8) ◽  
pp. 1003-1015 ◽  
Author(s):  
Todd Cochrane ◽  
Zhiyong Zheng
Keyword(s):  
Exponential Sum ◽  
Upper Bounds

scholarly journals Generator of PRN's on the norm group

2021 ◽  
Vol 25 (2(36)) ◽  
pp. 26-39
Author(s):  
P. Fugelo ◽  
S. Varbanets
Keyword(s):  
Prime Number ◽  
Quadratic Field ◽  
Exponential Sum ◽  
Random Numbers ◽  
Gaussian Integers ◽  
New Family ◽  
Serial Test ◽  
Polynomial Representations ◽  
Modulo P ◽  
Norm Group

Let $p$ be a prime number, $d\in\mathds{N}$, $\left(\frac{-d}{p}\right)=-1$, $m>2$, and let $E_m$ denotes the set of of residue classes modulo $p^m$ over the ring of Gaussian integers in imaginary quadratic field $\mathds{Q}(\sqrt{-d})$ with norms which are congruented with 1 modulo $p^m$. In present paper we establish the polynomial representations for real and imagimary parts of the powers of generating element $u+iv\sqrt{d}$ of the cyclic group $E_m$. These representations permit to deduce the ``rooted bounds'' for the exponential sum in Turan-Erd\"{o}s-Koksma inequality. The new family of the sequences of pseudo-random numbers that passes the serial test on pseudorandomness was being buit.

Approximation of an exponential sum by a shorter one

2007 ◽  
Vol 75 (1) ◽  
pp. 36-38 ◽  
Author(s):  
A. A. Karatsuba ◽  
M. A. Korolev
Keyword(s):  
Exponential Sum

A Multiple Exponential Sum to Modulus p2

1985 ◽  
Vol 28 (4) ◽  
pp. 394-396 ◽  
Author(s):  
D. R. Heath-Brown
Keyword(s):  
Algebraic Geometry ◽  
Exponential Sums ◽  
Exponential Sum ◽  
Total Degree ◽  
Image Position

AbstractFor suitable polynomials f(x) ∊ ℤ[x] in n variables, of total degree d, it is shown thatThis is, formally, a precise analogue of a theorem of Deligne [1] on exponential sums (mod p). However the proof uses no more than elementary algebraic geometry.

Sign in / Sign up

Export Citation Format

Share Document