Related papers: A Vorono\"i--Oppenheim summation formula for numbe…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
This paper gives new explicit formulas for sums of powers of integers and their reciprocals.
We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…
We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…
For an odd integer $d > 1$ and a finite Galois extension $K/\mathbb{Q}$ of degree $d$, G. L\"{u} and Z. Yang \cite{lu3} obtained an asymptotic formula for the mean values of the divisor function for $K$ over square integers. In this…
We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…
Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…
We derive Vorono\"{\dotlessi} summation formulas for the Liouville function $\lambda(n)$, the M\"{o}bius function $\mu(n)$, and for $d^{2}(n)$, where $d(n)$ is the divisor function. The formula for $\lambda(n)$ requires explicit evaluation…
An approach to constructing an upper bound for the Riemann-Farey sum is described.
The coefficients occurring in summation formulae of the Lubbock type are shown to be generalised Bernoulli polynomials which turn up in subdivision questions such as quantum field theory around a conical singularity and on spherical lunes.…
Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…
In this paper we present a generalization of Faulhaber's formula to sums of arbitrary complex powers $m\in\mathbb{C}$. These summation formulas for sums of the form $\sum_{k=1}^{\lfloor x\rfloor}k^{m}$ and $\sum_{k=1}^{n}k^{m}$, where…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.