Related papers: On arithmetic progressions in self-similar sets
For any $\beta > 1$, denoted by $r_n(x,\beta)$ the maximal length of consecutive zeros amongst the first $n$ digits of the $\beta$-expansion of $x\in[0,1]$. The limit superior (respectively limit inferior) of $\frac{r_n(x,\beta)}{n}$ is…
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 prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…
In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.
We prove results about the L^p-almost-periodicity of convolutions. One of these follows from a simple but rather general lemma about approximating a sum of functions in L^p, and gives a very short proof of a theorem of Green that if A and B…
Let $\beta > 1$ and the run-length function $r_n(x,\beta)$ be the maximal length of consecutive zeros amongst the first n digits in the $\beta$-expansion of $x\in[0,1]$. The exceptional set $$E_{\max}^{\varphi}=\left\{x \in…
By involving some exponential sums related to $\Lambda(n)$ in arithmetic progression, we can obtain some new results for von Mangoldt function over {\bf nonhomogeneous} Beatty sequences in arithmetic progressions, which improve some recent…
In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.
We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…
We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…
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…
We study arithmetic progressions $\{a,a+b,a+2b,\dots,a+(\ell-1) b\}$, with $\ell\ge 3$, in random subsets of the initial segment of natural numbers $[n]:=\{1,2,\dots, n\}$. Given $p\in[0,1]$ we denote by $[n]_p$ the random subset of $[n]$…
Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…
We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…
Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…
Let $\beta>1$ and let $m>\be$ be an integer. Each $x\in I_\be:=[0,\frac{m-1}{\beta-1}]$ can be represented in the form \[ x=\sum_{k=1}^\infty \epsilon_k\beta^{-k}, \] where $\epsilon_k\in\{0,1,...,m-1\}$ for all $k$ (a $\beta$-expansion of…
We determine asymptotic growth rates for lengths of monochromatic arithmetic progressions in certain automatic sequences. In particular, we look at (one-sided) fixed points of aperiodic, primitive, bijective substitutions and spin…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
Let $\beta\in(1,2)$ and $x\in [0,\frac{1}{\beta-1}]$. We call a sequence $(\epsilon_{i})_{i=1}^\infty\in\{0,1\}^{\mathbb{N}}$ a $\beta$-expansion for $x$ if $x=\sum_{i=1}^{\infty}\epsilon_{i}\beta^{-i}$. We call a finite sequence…
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…