Exponential sums on An. III

We give two applications of our earlier work [4]. We compute the p-adic cohomology of certain exponential sums on A ⁿ involving a polynomial whose homogeneous component of highest degree defines a projective hypersurface with at worst weighted homogeneous isolated singularities. This study was motivated by recent work of García [9]. We also compute the p-adic cohomology of certain exponential sums on A ⁿ whose degree is divisible by the characteristic. Received: 12 October 1999     

Exponential sums with Catalan numbers and middle binomial coefficients

We estimate the number of solutions of certain congruences with Catalan numbers and middle binomial coefficients modulo a prime. We use these results to bound double exponential sums with products of two Catalan numbers and two middle binomial coefficients, respectively, which in turn lead us to upper bounds on single exponential sums.     

p-Ary and q-ary versions of certain results about bent functions and resilient functions

Using the Teichmüller character and Gauss sums, we obtain the following results concerning p-ary bent functions and q-ary resilient functions: (1) a characterization of certain q-ary resilient functions in terms of their coefficients; (2) stronger upper bounds for the degree of p-ary bent functions; (3) determination of all bent functions on ; (4) a characterization of ternary weakly regular bent functions in terms of their coefficients.     

Twisted exponential sums of polynomials in one variable

The twisted T-adic exponential sums associated to a polynomial in one variable are studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the C-function of the twisted T-adic exponential sums. This bound gives lower bounds for the Newton polygon of the L-function of twisted p-power order exponential sums.     

Exponential sums over lifts of points

We give bounds for exponential sums associated to functions on curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and give bounds for the degrees of their coordinate functions. Then we get bounds for exponential sums, extending results of Kumar et al., Winnie Li over the projective line, and Voloch-Walker over elliptic curves and C_ab curves.     

Coloring,sparseness and girth

Using the classical analysis resolution of singularities algorithm of [G4], we generalize the theorems of [G3] on Rⁿ sublevel set volumes and oscillatory integrals with real phase function to functions over an arbitrary local field of characteristic zero. The p-adic cases of our results provide new estimates for exponential sums as well as new bounds on how often a function f(x), such as a polynomial with integer coefficients, is divisible by various powers of a prime p when x is an integer. Unlike many papers on such exponential sums and p-adic oscillatory integrals, we do not require the Newton polyhedron of the phase to be nondegenerate, but rather as in [G3] we have conditions on the maximum order of the zeroes of certain polynomials corresponding to the compact faces of this Newton polyhedron.     

Transformation formula for exponential sums involving fourier coefficients of modular forms

In 1984 Jutila [5] obtained a transformation formula for certain exponential sums involving the Fourier coefficients of a holomorphic cusp form for the full modular groupSL(2, ?). With the help of the transformation formula he obtained good estimates for the distance between consecutive zeros on the critical line of the Dirichlet series associated with the cusp form and for the order of the Dirichlet series on the critical line, [7]. In this paper we follow Jutila to obtain a transformation formula for exponential sums involving the Fourier coefficients of either holomorphic cusp forms or certain Maass forms for congruence subgroups ofSL(2, ?) and prove similar estimates for the corresponding Dirichlet series.     

On infinite products of functions in compact riemann surfaces

Letν′ be the complementary of a point ∞ in a compact Riemann surfaceν. The normal convergence in compact subsets ofν′ of an infinite product of meromorphic functions (with polynomic exponential singularities at ∞ of bounded degree) is shown in this paper to be equivalent to a certain type of convergence of the double series of Newton sums of the divisors of its factors. This applies, for instance, to products of Baker functions inν′ and to products of meromorphic functions inν. The result for this last case is also generalized to complementaries of arbitrary nonvoid finite subsets ofν. Research supported by SA30/00B.     

Fourier and barycentric formulae for equidistant Hermite trigonometric interpolation

We consider the Hermite trigonometric interpolation problem of order 1 for equidistant nodes, i.e., the problem of finding a trigonometric polynomial t that interpolates the values of a function and of its derivative at equidistant points. We give a formula for the Fourier coefficients of t in terms of those of the two classical trigonometric polynomials interpolating the values and those of the derivative separately. This formula yields the coefficients with a single FFT. It also gives an aliasing formula for the error in the coefficients which, on its turn, yields error bounds and convergence results for differentiable as well as analytic functions. We then consider the Lagrangian formula and eliminate the unstable factor by switching to the barycentric formula. We also give simplified formulae for even and odd functions, as well as consequent formulae for Hermite interpolation between Chebyshev points.     

Product type bounds on the approximation of values ofE andG functions

This paper obtains effective lower bounds on the absolute values of linear forms, over the integers, in power products of values of certain SiegelE-functions or SiegelG-functions. The bounds obtained are in terms of the product of the absolute values of the coefficients. ForE-functions the bound obtained is a best possible result, up to an arbitrarily small positive epsilon. ForG-functions the result is asymptotically best in the following sense: for each epsilon larger than zero there exists an integerN such that ifz, the point of evaluation, equalsM ^–1 whereM is an integer with absolute value larger thanN, then the bound obtained is within epsilon of a best possible bound. (From the proof it is clear thatz need not be the inverse of an integer. What is necessary that the absolute value of its numerator must be much smaller than the absolute value of its denominator.)Results obtained recently by D. V. andG. V. Chudnovsky bounding the absolute values of similar forms give bounds in terms of the maximum of the absolute values of the coefficients; such lower bounds can be much smaller.Dedicated to Professor E. Hlawka on the occasion of his seventieth birthday     

-functionals and multivariate Bernstein polynomials

This paper estimates upper and lower bounds for the approximation rates of iterated Boolean sums of multivariate Bernstein polynomials. Both direct and inverse inequalities for the approximation rate are established in terms of a certain K-functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums.     

Unclosed asymptotic expansions and mock theta functions

In his last letter to Hardy, Ramanujan defined 17 functions f(q), (|q|<1), which he called mock theta functions. Each f(q) has infinitely many exponential singularities at roots of unity, and under radial approach to every such singularity, f(q) has an asymptotic approximation consisting of a finite number of terms with closed exponential factors, plus an error term O(1). We give an example of a q-series in Eulerian form having an approximation with an unclosed exponential factor. Complete asymptotic expansions as q→1 of some shifted q-factorials are given in terms of polylogarithms and Bernoulli polynomials. Supported by the Natural Sciences and Engineering Research Council of Canada.     

Gauss sums and multinomial coefficients

Consider a Gauss sum for a finite field of characteristic p, where p is an odd prime. When such a sum (or a product of such sums) is a p-adic integer we show how it can be realized as a p-adic limit of a sequence of multinomial coefficients. As an application we generalize some congruences of Hahn and Lee to exhibit p-adic limit formulae, in terms of multinomial coefficients, for certain algebraic integers in imaginary quadratic fields related to the splitting of rational primes. We also give an example illustrating how such congruences arise from a p-integral formal group law attached to the p-adic unit part of a product of Gauss sums.     

Estimates on polynomial exponential sums

In this paper we establish new bounds on exponential sums of high degree for general composite moduli. The sums considered are either Gauss sums or ‘sparse’ and we rely on earlier work in the case of prime modulus.     

Optimal long-time $L_p}(0,T)$ stability and semidiscrete error estimates for the Volterra formulation of the linear quasistatic viscoelasticity problem

The purpose of this article is to show how the solution of the linear quasistatic (compressible) viscoelasticity problem, written in Volterra form with fading memory, may be sharply bounded in terms of the data if certain physically reasonable assumptions are satisfied. The bounds are derived by making precise assumptions on the memory term which then make it possible to avoid the Gronwall inequality, and use instead a comparison theorem which is more sensitive to the physics of the problem. Once the data-stability estimates are established we apply the technique also to deriving a priori error bounds for semidiscrete finite element approximations. Our bounds are derived for viscoelastic solids and fluids under the small strain assumption in terms of the eigenvalues of a certain matrix derived from the stress relaxation tensor. For isotropic materials we can be explicit about the form of these bounds, while for the general case we give a formula for their computation.     

Vertex Degrees of Steiner Minimal Trees in ℓ p d and Other Smooth Minkowski Spaces

We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) in the d -dimensional Banach spaces _p ^d independent of d . This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows exponentially in d [19]. Our upper bounds follow from characterizations of singularities of SMTs due to Lawlor and Morgan [14], which we extend, and certain _p -inequalities. We derive a general upper bound of d+1 for the degree of vertices of an SMT in an arbitrary smooth d -dimensional Banach space (i.e. Minkowski space); the same upper bound for Steiner points having been found by Lawlor and Morgan. We obtain a second upper bound for the degrees of vertices in terms of 1 -summing norms. Received April 22, 1997, and in revised form October 1, 1997.     

广义对角多项式指数和的估计

利用高斯和与次数矩阵Smith标准形的不变因子,给出了有限域上广义对角多项式指数和的估计,从而改进了Deligne-Weil型估计这类多项式指数和的结果.     

Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions

The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We give new bounds of exponential sums with sequences of iterations of Rédei functions over prime finite fields, which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators.     

On RSA Moduli with Prescribed Bit Patterns

We give a polynomial time probabilistic algorithm that constructs an RSA modulus M=pl, where p and l are two n-bit primes, which has about n/2 bits, on certain positions, prescribed in advance. Although the number of prescribed bits is less than in other constructions, this algorithm can be rigorously analyzed while the other approaches remain heuristic. The proof is based on bounds of exponential sums. We also show that this algorithm can be used for finding 2n-bit RSA moduli whose binary expansions are of Hamming weight about 3n/4. Finally, similar arguments are also applied to smooth integers.     

Characterization of Scattering Data for the AKNS System

We characterize the scattering data of the AKNS system with vanishing boundary conditions. We prove a 1,1-correspondence between L ¹-potentials without spectral singularities and Marchenko integral kernels which are sums of an L ¹ function (having a reflection coefficient as its Fourier transform) and a finite exponential sum encoding bound states and norming constants. We give characterization results in the focusing and defocusing cases separately.