We extend two well-known results in additive number theory, Sárközy's theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our proofs rely on a restriction-type Fourier analytic argument of Green and Green-Tao.
We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.
We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval $[1,\dots, n]$. The study continues the work of Komlós, Sulyok, and Szemerédi.
We show that sets avoiding 6-term arithmetic progressions in $\mathbb{Z}_6^n$ have size at most $5.709^n$. It is also pointed out that the "product construction" does not work in this setting, specially, we show that for the extremal sizes in small dimensions we have $r_6(\mathbb{Z}_6)=5$, $r_6(\mathbb{Z}_6^2)=25$ and $ 116\leq r_6(\mathbb{Z}_6^3)\leq 124$.
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$ and for families of structured sets called chains. In this paper we extend the formula to sets of every dimension and prove it for sets composed of three segments, giving structural results for the extremal case. A weaker extension to sets composed of a bounded number of segments is also discussed.
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 equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field.
Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$δ(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq |A|+2|B|-3-δ(A,B), then we show $A+B$ contains an arithmetic progression with difference 1 and length $|A|+|B|-1$. As a corollary, if \eqref{one} holds, $\max(B)\leq \max(A)$ and either $\gcd(A)=1$ or else $\gcd(A+B)=1$ and $|A+B|\leq 2|A|+|B|-3$, then $A+B$ contains an arithmetic progression with difference 1 and length $|A|+|B|-1$.
Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any configuration $\{v_1,...,v_\ell\}$ of vectors in $\mathbb{Z}^d$, we show that if $A\subset[1,N]^d$ with $|A|/N^d\geq C N^{-1/\ell}$, then there necessarily exists $r\ne0$ such that $\{rv_1, ...,rv_\ell\}\subseteq A-A$.
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 arithmetic progressions that satisfy additional congruence conditions and provide asymptotic approximations.
Given a sequence $\{b_{i}\}_{i=1}^{n}$ and a ratio $λ\in (0,1),$ let $E=\cup_{i=1}^n(λE+b_i)$ be a homogeneous self-similar set. In this paper, we study the existence and maximal length of arithmetic progressions in $E$. Our main idea is from the multiple $β$-expansions.
For an integer $b \geqslant 2$ and a set $S\subset \{0,\cdots,b-1\}$, we define the Kempner set $\mathcal{K}(S,b)$ to be the set of all non-negative integers whose base-$b$ digital expansions contain only digits from $S$. These well-studied sparse sets provide a rich setting for additive number theory, and in this paper we study various questions relating to the appearance of arithmetic progressions in these sets. In particular, for all $b$ we determine exactly the maximal length of an arithmetic progression that omits a base-$b$ digit.
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 arithmetic progressions. The argument also applies to `large sets' in the sense of Erdős-Turán. The proof is short, completely self-contained, and aims to give a heuristic explanation of why the primes, and other large sets, possess arithmetic structure.
We construct Salem sets in $\mathbb{R}/\mathbb{Z}$ of any dimension (including $1$) which do not contain any arithmetic progressions of length $3$. Moreover, the sets can be taken to be Ahlfors regular if the dimension is less than $1$, and the measure witnessing the Fourier decay can be taken to be Frostman in the case of dimension $1$. This is in sharp contrast to the situation in the discrete setting (where Fourier uniformity is well known to imply existence of progressions), and helps clarify a result of Laba and Pramanik on pseudo-random subsets of the real line which do contain progressi…
A Structure Theorem for Positive Density Sets Having the Minimal Number of 3-term Arithmetic Progressions
假设著名的猜想，[x，x+x^t]包含一个素数，t > 0和x足够大，我们证明：对于0 < r < 1，存在0 < s < r < 1，0 < d < 1，以及无穷多个素数q，使得如果S是Z/qZ的子集，其密度至少为s，且在所有密度集中至少有s个三项算术级数，则S在很强的意义下几乎是平移不变的.即，存在0 <= b <= q-1，使得|S intersect（S + bj）|=（1-g（s））|S|，对于每个0 < j < q^d，其中g（s）-> 0 as s -> 0。证明的一个奇怪的特点是，Behrend在{1，2，.}的大子集上的构造，x}不含3项a. p.，是一个关键因素。
Pach and Palincza proved the following generalization of Ellenberg and Gijswijt's bound for the size of $k$-term arithmetic progression-free subsets, where $k\in \{4,5,6\}$: Let $m>0$ be an integer such that $6$ divides $m$ and let $k\in \{4,5,6\}$. Then $$ r_k({\mathbb Z}_{m}^n)\leq (0.948m)^n $$ if $n$ is sufficiently large. Building on the proof technique of Pach and Palincza's upper bound we generalize the Ellenberg and Gijswijt's bound in the following way: Let $p>2$ be any integer and let $q>2$ be a prime. Suppose that $p\leq q$. Then the there exists an $n_0\in \mathbb N$ integer and a …
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 provided in an earlier paper up to a multiplicative constant. For sets of complex numbers we improve the bound to $O_ε(n^{1 + ε})$ for arbitrary $ε> 0$ assuming the GRH.
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(\frac{n\log^2 n}{\log \log n})$ and present an example of a product set containing an arithmetic progression of length $Ω(n \log n)$. For sets of complex numbers we obtain the upper bound $O(n^{3/2})$.
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements we can restrict the implicit parameter to those integers that have an even number of distinct prime factors, or satisfy any other congruence condition. In order to obtain these refinements we study the limiting behavior of some closely related multiple ergodic averages with weights given by appropriately chosen multiplicative functions. These averages are the…
This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such progression. We prove that there exists a positive constant $c$ and a set $A \subset \mathbb F_q^n$ which does not contain a four-term arithmetic progression, with the property that for every subset $A' \subset A$ with $|A'| \geq |A|^{1-c}$, $A'$ contains a nontrivial three term arithmetic progression. We derive this from a more general quantitative Roth-type the…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to Schur triples, and, more generally, to the number of edges in random induced subhypergraphs of `almost linear' k-uniform hypergraphs.
Arithmetic progressions in a random set on a budget
Institute of Computer Science of the Czech Academy of Sciences（捷克科学院计算机研究所）；Leipzig University（莱比锡大学）；Faculty of Informatics, Masaryk University（马萨里克大学信息学院）；Mathematics Institute, University of Warwick（华威大学数学研究所）
Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games, similar to those introduced by Holshouser, Reiter, Smith, Stănică, can be defined as having its sets of winning positions identical to well-known sets avoiding arithmetic progressions such as $x+z=2y$, studied by Szerkeres, Erd\H os and Turán, and many others, thus exploring a new territory combining ideas from combinatorial games and combinatorial number theory. …
Inspired by the Erdös-Turan conjecture we consider subsets of the natural numbers that contains infinitely many aritmetic progressions (APs) of any given length - such sets will be called AP-sets and we know due to the Green-Tao Theorem and Sźmeredis Theorem that the primes and all subsets of positive upper density are AP-sets. We prove that (1, 1,..., 1) is a solution to the equation Mx = 0 where M is an integer matrix whose null space has dimension at least 2, if and only if the equation has infinitely many solutions such that the coordinates of each solution are elements in the same AP. Thi…
Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that $$\lim_{n \to \infty} \frac{\log f_{s,k}(n)}{\log n} = 2,$$ which answers an old question of Erdős. In fact, we prove upper and lower bounds for $f_{s,k}(n)$ which show that its growth is closely related to the bounds in Szemerédi's theorem.
The complexity $\Vert n\Vert$ of a natural number is the least number of $1$ needed to represent $n$ using the 5 symbols $(, ), *, +, 1$. A natural number $n$ is called stable is $\Vert 3^kn\Vert =\Vert n\Vert +3k$. For each natural number $n$, the number $3^an$ is stable for some $a\ge0$, and we define the stable complexity of $n$ as $\Vert n \Vert _{\rm st}=\Vert 3^an\Vert -3a$. We show that the closure of the set of all fractions $n/3^{\lfloor \Vert {n}\Vert _{\rm st}/3\rfloor}$ has remarkable properties; self-similarity $3K'''=K$, well-ordered, and certain arithmetical properties. We pose …
Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest such $k$ is $2^m$.Moreover, we generalize this result to middle-$\frac 1α$ Cantor set for $1<α<2+\sqrt{5}$ and $m$ sufficiently large.For the naturally embedded image $W$ of the Cantor dust $C\times C$ into the complex plane $\mathbb{C}$, we prove that for any integer $m\ge 3$, every element in the closed unit disk in $\mathbb C$ can be written as the sum of at…
If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \in A$, we find the unique $a \in A$ such that $a_1 + a_2 \equiv a$ mod $m$, and call $(a_1 + a_2 -a)/m$ the carry. Carries occur also when addition is done modulo $m^2$, with $A$ chosen as a set of coset representatives for the cyclic group $\mathbb{Z}/m \mathbb{Z} \subseteq \mathbb{Z}/m^2\mathbb{Z}$. It is a natural to look for sets $A$ which minimize the number of different carries. In a recent paper, Diaconis…
Thresholds and Fluctuations for Colorful Arithmetic Progressions in Sparse Random Colorings
University of Pennsylvania（宾夕法尼亚大学）；National University of Singapore（新加坡国立大学）；Stanford University（斯坦福大学）；Indian Statistical Institute, Kolkata（印度统计学院，加尔各答）
We show that the dynamical degree of an (i.i.d) random sequence of dominant, rational self-maps on projective space is almost surely constant. We then apply this result to height growth and height counting problems in random orbits.
Let $K_1$ and $K_2$ be two one-dimensional homogeneous self-similar sets. Let $f$ be a continuous function defined on an open set $U\subset \mathbb{R}^{2}$. Denote the continuous image of $f$ by $$ f_{U}(K_1,K_2)=\{f(x,y):(x,y)\in (K_1\times K_2)\cap U\}. $$ In this paper we give an sufficient condition which guarantees that $f_{U}(K_1,K_2)$ contains some interiors. Our result is different from Simon and Taylor's \cite[Proposition 2.9]{ST} as we do not need the condition that the multiplication of the thickness of $K_1$ and $K_2$ is strictly greater than $1$. As a consequence, we give an appli…
