Related papers: Discrepancy in modular arithmetic progressions
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…
The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…
Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every $\alpha>0$, $\beta<\alpha^3$, and prime number $p$, there is a least positive…
Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…
In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…
We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set $S\subseteq\mathbb{Z}_q^n$ containing $|S|=\mu\cdot q^n$ elements must contain at…
Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…
We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…
Let $\overline{p}(n)$ denote the overpartition function. In this paper, we study the asymptotic growth of finite difference of logarithm of $\sqrt[n]{\overline{p}(n)/n^{\alpha}}$ for $\alpha$ being a non-negative real number, namely…
We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
We show that for every fixed $A>0$ and $\theta>0$ there is a $\vartheta=\vartheta(A,\theta)>0$ with the following property. Let $n$ be odd and sufficiently large, and let $Q_{1}=Q_{2}:=n^{\h}(\log n)^{-\vartheta}$ and $Q_{3}:=(\log…
Let $\varepsilon>0$ be given. For prime power moduli $q=p^k$ with $k\geq 2$ and $p\neq 3$, and assuming the Ramanujan--Petersson conjecture for $\GL_2$ Maass forms, we prove that the Rankin--Selberg coefficients $\{\lambda_f(n)^2\}_{n\geq…
We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a…
We derive an asymptotic formula for the divisor function $\tau(k)$ in an arithmetic progression $k\equiv a(\bmod \ q)$, uniformly for $q\leq X^{\Delta_{n,l}}$ with $(q,a)=1$. The parameter $\Delta_{n,l}$ is defined as $$…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…
Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…
Recently, Romik determined in [9] the Taylor expansion of the Jacobi theta constant \theta_3, around the point x = 1. He discovered a new integer sequence, (d(n))_0^\infty=1, 1, -1, 51, 849, -26199, \dots, from which the Taylor coefficients…
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…