Assume the Generalised Riemann Hypothesis. If $A\subseteq \{1,...,N\}$ contains no two elements differing by $p+1$, $p$ prime, then $|A|\ll N^{\frac{79}{80} + o(1)}$.
Let $q \equiv 1 \bmod 8$ be a prime power. We prove that $L\left(\tfrac{1}{2}, \chi\right) \neq 0$ for 100% of the imaginary quadratic Dirichlet characters of $\mathbb{F}_q(T)$.
For a finite set $S$ of positive integers, put $K(S):=-\min_{x\in\mathbb T}\sum_{s\in S}\cos(2\pi sx)$. Bedert recently proved the uniform lower bound $K(S)\geq |S|^{1/5-o(1)}$. We remove the subpolynomial loss and prove that $K(S)\geq c|S|^{1/5}$ for an absolute constant $c>0$. The proof combines two estimates from Be...
Let $q_n$ denote the $n$th product of two distinct primes. By completing a square in Sono's sieve and solving the resulting one-dimensional variational problem, we prove unconditionally that, for every $\varepsilon>0$ and all sufficiently large integers $\rho$, \[ \liminf_{n\to\infty}(q_{n+\rho}-q_n) \leq \exp\left((\p...
We determine, up to a factor of $2^{o(k)}$, the number of $k$-sets $A \subset \{1, \ldots, n\}$ such that $|A + A| \leq m$, where $k = \Theta(\log n)$ and $m \leq k^{1 + \alpha}$, for small $\alpha>0$, answering a question of Green and Morris.
We prove that $N$ points in $\mathbb{R}^3$ determine at least $N^{2/3-o(1)}$ distinct distances.
We show that there exists $c>0$ such that any subset of $\{1,\ldots,N\}$ having size $\gg N / \exp( (\log\log\log N)^c )$ contains a nontrivial pattern of the form $x,x+y,x+2y,x+y^3$. It is the first configuration of complexity strictly greater than $0$, other than refinements of arithmetic progressions, for which quan...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
