Related papers: The exponential sum over squarefree integers

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erd\"os and Renyi.

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial at the zeros of a system of n Laurent polynomials in the complex n-torus whose Newton polyhedra have generic mutual positions. An exponential change of…

We prove part of a conjecture of Borwein and Choi concerning an estimate on the square of the number of solutions to n=x^2+Ny^2 for a squarefree integer N.

It is not difficult to find an asymptotic formula for the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree. In the present paper we improve the estimate for the error term in this formula using the…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

We study congruences between cuspidal modular forms and Eisenstein series at levels which are square-free integers and for equal even weights. This generalizes our previous results from Naskr\k{e}cki [17] for prime levels and provides…

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

In this paper, we use methods of exponential sums to derive a formula for estimating effective upper bounds of $|\zeta'(1/2+it)|$. Different effective upper bounds can be obtained by choosing different parameters.

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

For an odd positive integer $n\ge 5$, assuming the truth of the $abc$ conjecture, we show that for a positive proportion of pairs $(a,b)$ of integers the trinomials of the form $t^n+at+b (a,b\in \mathbb Z)$ are irreducible and their…

A word is \emph{square-free} if it does not contain non-empty factors of the form $XX$. In 1906 Thue proved that there exist arbitrarily long square-free words over $3$-letter alphabet. We consider a new type of square-free words. A…

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

We prove the intersection of Igusa's Conjecture of [Igusa, J., "Lectures on forms of higher degree", Lect. math. phys., Springer-Verlag, 59 (1978)] and the Denef - Sperber Conjecture of [Denef, J. and Sperber, S., "Exponential sums mod p^n…

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

We develop a general approach for showing when a set of integers $\mathscr{A}$ has infinitely many $k^{th}$ powerfree numbers without relying on equidistribution estimates for $\mathscr{A}$. In particular, we show that if the Fourier…