On the Lower Bound of the Divisibility of Exponential Sums in Binomial Case

In this article,we analyze the lower bound of the divisibility of families of exponential sums for binomials over prime field.An upper bound is given for the lower bound,and,it is related to permutation polynomials.     

Some Alternating Double Binomial Sums

We consider some new alternating double binomial sums. By using the Lagrange inversion formula, we obtain explicit expressions of the desired results which are related to a third-order linear recursive sequence. Furthermore, their recursive relation and generating functions are obtained.     

Interpolation Formulas for Functions of Exponential Type

In the paper we present a derivative-free estimate of the remainder of an arbitrary interpolation rule on the class of entire functions which, moreover, belong to the space L² _(-,+). The theory is based on the use of the Paley-Wiener theorem. The essential advantage of this method is the fact that the estimate of the remainder is formed by a product of two terms. The first term depends on the rule only while the second depends on the interpolated function only. The obtained estimate of the remainder of Lagrange's rule shows the efficiency of the method of estimate. The first term of the estimate is a starting point for the construction of the optimal rule; only the optimal rule with prescribed nodes of the interpolatory rule is investigated. An example illustrates the developed theory.     

Extremal Properties of Sums of Binomial Coefficients

Some extremal problems for the sums of binomial coefficients that arise in research on estimating the computational complexity of discrete optimization algorithms are examined. These extremal problems are solved using the theory of majorization and useful inequalities are introduced for the sums of binomial coefficients.     

Double Exponential Sums and Some Applications

.?We give three estimates on bilinear exponential sums of type I. As application we prove that , where the A _j are effective constants and t(?) denotes the number of unitary factors of a finite abelian group ?. This improves on the previous result.     

Equivalent Characterization of Entire Functions of Exponential Type

In this paper, we show that a necessary and sufficient condition for the fulfillment of the relation s _m ^(k) (f) – f^(k) _p 0 as m , 1 < p < , k 0,1,2,..., is that f B _,p , where B _,p = B L _p (R), and B denotes the subset of all entire functions of exponential type which are bounded on R, B _,p is usually called Paley-Wiener class, and s _m (f) is the unique cardinal spline of degree m – 1 interpolating f at the integers. Moreover, we obtain three equivalent forms for the characterization of the class B _,p .     

On the Approximation of Functions by Polynomials and Entire Functions of Exponential Type

Ukrainian Mathematical Journal - We present a brief survey of works in the approximation theory of functions known to the author and connected with V. K. Dzyadyk’s research works.     

Exponential Sums Equations and the Schanuel Conjecture

A uniform version of the Schanuel conjecture is discussed thathas some model-theoretical motivation. This conjecture is assumed,and it is proved that any ‘non-obviously-contradictory’system of equations in the form of exponential sums with realexponents has a solution.     

Asymptotics and Formulas for Cubic Exponential Sums

Several asymptotic expansions and formulas for cubic exponential sums are derived. The expansions are most useful when the cubic coefficient is in a restricted range. This generalizes previous results in the quadratic case and helps to clarify how to numerically approximate cubic exponential sums and how to obtain upper bounds for them in some cases.     

Equivalence of Cauchy Problems for Entire and Exponential Type Functions

We answer two problems posed by H. S. Shapiro in [1], and weshow that, in general, there is no equivalence between the Cauchyproblem for entire functions and the one for exponential typefunctions. We characterize some situations for which the equivalenceholds.     

Identities for Alternating Inverse Squared Binomial and Harmonic Number Sums

We develop new families of closed-form representations of sums of alternating harmonic numbers and reciprocal squared binomial coefficients including integral representations.     

Exponential Sums and the Riemann Zeta Function V

A Van der Corput exponential sum is S = exp (2 i f(m)) wherem has size M, the function f(x) has size T and = (log M) / log T < 1. There are different bounds for S in differentranges for . In the middle range where is near 1/over 2, . This bounds the exponent of growthof the Riemann zeta function on its critical line Re s = 1/over2. Van der Corput used an iteration which changed at each step.The Bombieri–Iwaniec method, whilst still based on meansquares, introduces number-theoretic ideas and problems. TheSecond Spacing Problem is to count the number of resonancesbetween short intervals of the sum, when two arcs of the graphof y = f'(x) coincide approximately after an automorphism ofthe integer lattice. In the previous paper in this series [Proc.London Math. Soc. (3) 66 (1993) 1–40] and the monographArea, lattice points, and exponential sums we saw that coincidenceimplies that there is an integer point close to some ‘resonancecurve’, one of a family of curves in some dual space,now calculated accurately in the paper ‘Resonance curvesin the Bombieri–Iwaniec method’, which is to appearin Funct. Approx. Comment. Math. We turn the whole Bombieri–Iwaniec method into an axiomatisedstep: an upper bound for the number of integer points closeto a plane curve gives a bound in the Second Spacing Problem,and a small improvement in the bound for S. Ends and cusps ofresonance curves are treated separately. Bounds for sums oftype S lead to bounds for integer points close to curves, andanother branching iteration. Luckily Swinnerton-Dyer's methodis stronger. We improve from 0.156140... in the previous paperand monograph to 0.156098.... In fact (32/205 + , 269/410 +) is an exponent pair for every > 0. 2000 Mathematics SubjectClassification 11L07 (primary), 11M06, 11P21, 11J54 (secondary).     

Exponential Sums and Coding Theory: A Review

This article is a survey of several recent applications of methods from analytic number theory to research in coding theory, including results on Kloosterman codes, binary Goppa codes, and prime phase shift sequences. The mathematical methods focus on exponential sums, in particular Kloosterman sums. The interrelationships with the Weil–Carlitz–Uchiyama bound, results on Hecke operators, theorems of Bombieri and Deligne and the Eichler–Selberg trace formula are reviewed.     

Newton Polygons of L Functions Associated with Exponential Sums of Polynomials of Degree Four over Finite Fields

Let F_q be the finite field of q elements with characteristic p and F_q^m its extension of degree m. Fix a nontrivial additive character Ψ of F_p. If f(x₁,…, x_n)∈F_q[x₁,…, x_n] is a polynomial, then one forms the exponential sum S_m(f)=∑_{(x1,…,xn)∈(Fq^m)ⁿ}Ψ(Tr_Fq^m/Fp(f(x₁,…,x_n))). The corresponding L functions are defined by L(f, t)=exp(∑^∞_m=0S_m(f)t^m/m). In this paper, we apply Dwork's method to determine the Newton polygon for the L function L(f(x), t) associated with one variable polynomial f(x) when deg f(x)=4. As an application, we also give an affirmative answer to Wan's conjecture for the case deg f(x)=4.     

A Fourth Derivative Test for Exponential Sums

We give an upper bound for the exponential sum ^M _m=1 e^2if(m) in terms of M and , where is a small positive number which denotes the size of the fourth derivative of the real valued function f. The classical van der Corput's exponent 1/14 is improved into 1/13 by reducing the problem to a mean square value theorem for triple exponential sums.     

On Exponential Sums Related to the Circle Problem

Let r(n) count the number of representations of a positive integer n as a sum of two integer squares. We prove a truncated Voronoi-type formula for the twisted Mobius transform

Expected Sums of General Parking Functions

A (u₁, u₂, . . . )-parking function of length n is a sequence (x₁, x₂, . . . , x_n) whose order statistics (the sequence (x₍₁₎, x₍₂₎, . . . , x_(n)) obtained by rearranging the original sequence in non-decreasing order) satisfy x_(i) u_(i). The Gonarov polynomials g _n (x; a₀, a ₁, . . . , a _n-1) are polynomials biorthogonal to the linear functionals (a _i) Dⁱ, where (a) is evaluation at a and D is differentiation. In this paper, we give explicit formulas for the first and second moments of sums of u-parking functions using Gonarov polynomials by solving a linear recursion based on a decomposition of the set of sequences of positive integers. We also give a combinatorial proof of one of the formulas for the expected sum. We specialize these formulas to the classical case when u _i=a+ (i-1)b and obtain, by transformations with Abel identities, different but equivalent formulas for expected sums. These formulas are used to verify the classical case of the conjecture that the expected sums are increasing functions of the gaps u_i+1 - u_i. Finally, we give analogues of our results for real-valued parking functions.AMS Subject Classification: 05A15, 05A19, 05A20, 05E35.