Related papers: Estimates for a three-dimensional exponential sum …
We obtain series expansion formulas for the Hadamard fractional integral and fractional derivative of a smooth function. When considering finite sums only, an upper bound for the error is given. Numerical simulations show the efficiency of…
We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…
We obtain several estimates for trilinear form with double Kloosterman sums. In particular, these bounds show the existence of nontrivial cancellations between such sums.
We obtain new bounds on some trilinear and quadrilinear character sums, which are non-trivial starting from very short ranges of the variables. An application to an apparently new problem on oscillations of characters on differences between…
We use the circle method to obtain tight bounds on the $L^p$ norm of an exponential sum involving the divisor function for $p > 2$.
I present a novel mathematical technique for dealing with the infinities arising from divergent sums and integrals. It assigns them fine-grained infinite values from the set of hyperreal numbers in a manner that refines the standard…
In this paper we present some interesting results involving summation of series in particular trigonometric ones. We failed to locate these results in existing literature or in the web like MathWorld (http://mathworld.wolfram.com/) nor…
We discuss exponential sums on affine space from the point of view of Dwork's p-adic cohomology theory
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
In this paper, we study the weighted sums of multiple t-values and of multiple t-star values at even arguments. Some general weighted sum formulas are given, where the weight coefficients are given by (symmetric) polynomials of the…
We give a new algorithm for merging sorted lists of monomials. Together with a projection technique we obtain a new complexity bound for the BM-algorithm.
We study a family of exponential sums that arises in the study of the horocyclic flow on $\mathrm{GL}_n$. We prove an explicit version of general purity and find optimal bounds for these sums.
The {\lambda}-exponential family has recently been proposed to generalize the exponential family. While the exponential family is well-understood and widely used, this it not the case of the {\lambda}-exponential family. However, many…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some applications to primes in short intervals.
We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.
In this paper, we present some explicit exponents in the estimates for the volumes of sub-level sets of polynomials on bounded sets, and applications to the decay of oscillatory integrals and the convergent of singular integrals.
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…