Related papers: Two dimensional arithmetic progressions avoiding s…

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger…

For two relatively prime square-free positive integers $a$ and $b$, we study integers of the form $a p+b P_{2}$ and give a new lower bound for the number of such representations, where $a p$ and $b P_{2}$ are both square-free, $p$ denote a…

We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…

We investigate the relationships between several classical notions in arithmetic combinatorics and geometry including: the presence (or lack of) arithmetic progressions (or patches in dimensions $\geq 2$); the structure of tangent sets; and…

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound…

In this paper we solve a selection problem for multidimensional SDE $d X^\varepsilon(t)=a(X^\varepsilon(t)) d t+\varepsilon \sigma(X^\varepsilon(t))\, d W(t)$, where the drift and diffusion are locally Lipschitz continuous outside of a…

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

We study sets of bounded remainder for the two-dimensional continuous irrational rotation $(\{x_1+t\}, \{x_2+t\alpha \})_{t \geq 0}$ in the unit square. In particular, we show that for almost all $\alpha$ and every starting point $(x_1,…

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

In this paper, the optimal convergence rate $O\left(N^{-1/2}\right)$ (where $N$ is the total number of iterations performed by the algorithm), without the presence of a logarithmic factor, is proved for mirror descent algorithms with…

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

In the present paper we prove that there exist infinitely many arithmetic progressions of three different primes $p_1,p_2,p_3=2p_2-p_1$ such that $p_1=x_1^2 + y_1^2 +1$, $p_2=x_2^2 + y_2^2 +1$.

We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…

Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, this improves the previous best-known…

Suppose that G is an abelian group and A is a finite subset of G containing no three-term arithmetic progressions. We show that |A+A| >> |A|(log |A|)^{1/3-\epsilon} for all \epsilon>0.

The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

We prove that if $A\subset \{1,\dots,N\}$ has no nontrivial three-term arithmetic progressions, then $|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the…