Related papers: On arithmetic progressions in self-similar sets

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Given $\beta>1$ and $\alpha\in[0,1)$, let $T_{\beta, \alpha}(x)=\beta x+\alpha\pmod 1$. Then under the map $T_{\beta,\alpha}$ each $x\in[0,1]$ has an \emph{intermediate $\beta$-expansion} of the form…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

For an integer $b\geq 2$, we call a positive integer $b$-anti-Niven if it is relatively prime to the sum of the digits in its base-$b$ representation. In this article, we investigate the maximum lengths of arithmetic progressions of…

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

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…

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

Let \( \ell_n(x) \) denote the maximal run-length among the first \( n \) digits of the L\"{u}roth expansion of \( x\in(0,1] \). While \( \ell_n(x) \) grows logarithmically, we investigate the finer multifractal properties of the…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

A strictly increasing sequence of positive integers is called a slightly curved sequence with small error if the sequence can be well-approximated by a function whose second derivative goes to zero faster than or equal to $1/x^\alpha$ for…

Let $\be\in(1,2)$. Each $x\in I_\be:=[0,\frac{1}{\be-1}]$ can be represented in the form \[ x=\sum_{k=1}^\infty a_k\be^{-k}, \] where $a_k\in\{0,1\}$ for all $k$ (a $\be$-expansion of $x$). It was shown in \cite{S} that a.e. $x\in I_\be$…

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

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…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

Let $\beta > 1$ be a real number and $(\epsilon_1(x, \beta), \epsilon_2(x, \beta), \ldots)$ be the $\beta$-expansion of a point $x \in (0, 1]$. For all $x \in (0,1]$, let $A(D(x))$ be the set of accumulation points of $\frac{-\log_\beta…

We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given $k\geq 4$ and $L\geq 3$ there are only finitely many arithmetic progressions of the form…