Related papers: The exponential sum over squarefree integers

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

Let $g:\mathbb{N}\to\{-1,1\}$ be a completely multiplicative function, $\mu$ be the M\"obius function and $\mu_2^2(n)$ be the indicator that $n$ is cubefree. We prove that $f=\mu^2g$ and $f=\mu_2^2g$ have unbounded partial sums. Our proofs…

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C.…

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

We discuss exponential sums on affine space from the point of view of Dwork's p-adic cohomology theory

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

We cosider the number of r-tuples of squarefree numbers in a short interval. We prove that it cannot be much bigger than the expected value and we also estabish an asymptotic formula if the interval is not very short.

Freiman and Scourfield proved that any large enough integer can be written as a sum of a certain number of ascending even powers. We use the circle method to provide the first explicit bound on this number, and show that any large enough…

In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…

This is an exposition of results of R.C. Vaughan and the author (Mathematika 70 (2024), no. 4). We discuss how often the squarefree values of an integral polynomial do occur. We discuss interrelations between our results and results of B.…

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…

Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised…

In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n^2+1,n^2+2$ and $n^2+3$ are squarefree. We also improve the error…

Using the theory of metaplectic forms,we study the asymptotic behavior of cubic exponential sums over the ring of Eisenstein integers. In the first part of the paper, some non-trivial estimates on average over arithmetic progressions are…

In 2022, Bergelson and Richter gave a new dynamical generalization of the prime number theorem by establishing an ergodic theorem along the number of prime factors of integers. They also showed that this generalization holds as well if the…

Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…