Related papers: The exponential sum over squarefree integers

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

In this paper we obtain some new estimates for multilinear exponential sums in prime fields with a more general class of weights than previously considered. Our techniques are based on some recent progress of Shkredov on multilinear sums…

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

We show that there exists $\eta > 0$ such that the interval $[X, X + X^{\frac 15 - \eta}]$ contains a squarefree number for all large $X$. This improves on an earlier result of Filaseta and Trifonov who showed that there is a squarefree…

We show that, in contrast to the integers setting, almost all even order abelian groups $G$ have exponentially fewer maximal sum-free sets than $2^{\mu(G)/2}$, where $\mu(G)$ denotes the size of a largest sum-free set in $G$. This confirms…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…

We extend bounds on additive energies of modular square roots by Dunn, Kerr, Shparlinski, Shkredov and Zaharescu and apply these results to obtain bounds on certain bilinear exponential sums with modular square roots. From here, we make…

We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Congruences of truncated sums of infinite series do not directly extend to congruences of the truncated sums of higher powers of these infinite series. Guo and Zudilin recently established a variety of supercongruences for truncated sums of…

This is an expository account of the proof of the theorem of Bourgain, Glibichuk and Konyagin which provides non-trivial bounds for exponential sums over very small multiplicative subgroups of prime finite fields.

Let $d\geq 2$ be a squarefree integer, let $\omega\in\{\sqrt{d},\frac{1+\sqrt{d}}{2}\}$ be such that $\mathbb{Z}[\omega]$ is the ring of algebraic integers of the real quadratic number field $\mathbb{Q}(\sqrt{d})$, let $\varepsilon>1$ be…

We establish bounds of triple exponential sums with mixed exponential and linear function. The method we use is by Shparlinski together with a bound of additive energy from Roche-Newton, Rudnev and Shkredov.

Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…