Related papers: On Character Sums and Exponential Sums over Genera…

In this paper, new relations between the derivatives of the Legendre polynomials are obtained, and by these relations, new upper bounds for the Legendre coefficients of differentiable functions are presented. These upper bounds are sharp…

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

In this paper, we establish sharp upper bounds on shifted moments of the family of Dirichlet $L$-functions to a fixed modulus over function fields. We apply the result to obtain upper bounds on moments of Dirichlet character sums over…

In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.

Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…

If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications…

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.

In this paper, we establish Brezin-Li-Yau type lower bounds for averaged sums of Dirichlet eigenvalues of the Laplacian and poly-Laplacian on bounded domains in Euclidean spaces. By deriving expansions of two binary polynomials which may be…

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…

We prove sharp $L^p-L^q$ estimates for averaging operators along general polynomial curves in two and three dimensions. These operators are translation-invariant, given by convolution with the so-called affine arclength measure of the curve…

In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…