Related papers: Squarefree integers in large arithmetic progressio…

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.…

G. Ricotta and E. Royer (2018) have recently proved that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums $S(a,b;p^n)/p^(n/2) converge in law in the Banach space of complex-valued continuous function…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…

Let $\chi$ be a primitive character modulo a prime $q$, and let $\delta > 0$. It has previously been observed that if $\chi$ has large order $d \geq d_0(\delta)$ then $\chi(n) \neq 1$ for some $n \leq q^{\delta}$, in analogy with…

For $q \geq 2$, $n \in \mathbb{N}$, let $s_{q}(n)$ denote the sum of the digits of $n$ written in base $q$. Spiegelhofer (2020) proved that the Thue--Morse sequence has level of distribution $1$, improving on a former result of Fouvry and…

Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has…

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…

We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

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…

In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.

In this paper, we study different generalizations of the notion of squarefreeness for ideals to the more general case of modules. We describe the cones of Hilbert functions for squarefree modules in general and those generated in degree…

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…