Related papers: On an approximation by Vaughan in restricted sets …
We say that $d_3(n)$ has exponent of distribution $\theta$ if, for every $\varepsilon>0$, the expected asymptotic holds uniformly for all moduli $q \le x^{\theta-\varepsilon}$. Nguyen proved, following earlier work of Banks, Heath-Brown,…
Celebrated theorems of Roth and of Matou\v{s}ek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta(n^{1/4})$. We study the analogous problem in the $\mathbb{Z}_n$ setting.…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…
We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…
We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…
In this note, we approximate the average of prime powers in the decomposition of $n!$ into prime numbers.
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection…
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval…
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…
A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…
We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…
This paper is devoted to first-order algorithms for smooth convex optimization with inexact gradients. Unlike the majority of the literature on this topic, we consider the setting of relative rather than absolute inexactness. More…
Gaussian processes (GPs) provide a probabilistic nonparametric representation of functions in regression, classification, and other problems. Unfortunately, exact learning with GPs is intractable for large datasets. A variety of approximate…
We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
A deep conjecture of Montgomery and Soundararajan on the distribution of prime numbers in short intervals of length $h$ says that the third moment is bounded by $\ll h^{\frac {3}{2}-c}$ for some $c>0$. There is in the literature some…