Izabella Laba, Michael T. Lacey
We construct subsets of {1,...,N} of cardinality at least N exp(-C(log N)^{1/(k+1)}) which do not contain arithmetic progressions of length 2^k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic progressions of length 3.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log N$. By the same method we also improve the bounds in the analogous problem over $\mathbb{F}_q[t]$ and for the problem of finding long arithmetic progressions in a sumset.
We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a conjecture of Erdős on arithmetic progressions.
In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an arithmetic progression of length at least log^{1/4+o(1)} x.
We prove that if one has k non-intersecting arithmetic progressions of integers, with common differences 2 <= q_1,...,q_k <= x, then k < x exp((-1/6 + o(1)) sqrt(log x loglog x)). This improves a result of Szemeredi and Erdos.
Integer Sets of Large Harmonic Sum Which Avoid Long Arithmetic Progressions
本研究给出数字受限整数集不含k项算术级数的条件，通过大规模搜索找到不含4项与10项算术级数且调和和优于传统贪心构造的整数集，可高效计算相关集合与调和和。
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.
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 study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset of) the primes up to $N$ with common difference $O((\log N)^{L_k})$, for an unspecified constant $L_k$. In this work we obtain this statement with the precise value $L_k = (k-1) 2^{k-2}$. This is achieved by proving a relative version of Szemerédi's theorem for narrow progressions requiring simpler pseudorandomness hypotheses in the spirit of recent work of…
Asymptotics of partition parts in arithmetic progressions
研究算术级数中分拆部分的分布，通过分析生成函数中的非模艾森斯坦级数，获得捕获所有指数增长项的新近结果。
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 on the discrepancy of set systems of subcubes of the boolean cube $\{0, 1\}^d$.
Given two sets $\cA, \cB \subseteq \F_q$ of elements of the finite field $\F_q$ of $q$ elements, we show that the productset $$ \cA\cB = \{ab | a \in \cA, b \in\cB\} $$ contains an arithmetic progression of length $k \ge 3$ provided that $k<p$, where $p$ is the characteristic of $\F_q$, and $# \cA # \cB \ge 3q^{2d-2/k}$. We also consider geometric progressions in a shifted productset $\cA\cB +h$, for $f \in \F_q$, and obtain a similar result.
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.
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.
An inverse theorem for generalized arithmetic progression with mild multiplicative property
本文证明了 $\F_p$ 中包含另外两个数列大乘积集的广义等差数列的结构定理。
We show that $\sqrt{k}\cdot r^{k/2}$ is a threshold interval length where, under mild conditions, almost every $r$-coloring of an interval of longer length contains a monochromatic $k$-term arithmetic progression, while almost no $r$-coloring of an interval of shorter length contains a monochromatic $k$-term arithmetic progression.
In a recent paper, Harju posed three open problems concerning square-free arithmetic progressions in infinite words. In this note we solve two of them.
Permutations of the positive integers avoiding arithmetic progressions of length $5$ were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length $7$. We construct a permutation of the integers avoiding arithmetic progressions of length $6$. We also prove a lower bound of $\frac{1}{2}$ on the lower density of subsets of positive integers that can be permuted to avoid arithmetic progressions of length $4$, sharpening the lower bound of $\frac{1}{3}$ from (LeSaulnier and Vijay, 2011). In addition, we generalize several…
We investigate a restriction of Paul Erdos' well-known problem from 1936 on the discrepancy of homogeneous arithmetic progressions. We restrict our attention to a finite set S of homogeneous arithmetic progressions, and ask when the discrepancy with respect to this set is exactly 1. We answer this question when S has size four or less, and prove that the problem for general S is NP-hard, even for discrepancy 1.
In this paper, we study the rainbow Erdős-Rothschild problem with respect to 3-term arithmetic progressions. We obtain the asymptotic number of $r$-colorings of $[n]$ without rainbow 3-term arithmetic progressions, and we show that the typical colorings with this property are 2-colorings. We also prove that $[n]$ attains the maximum number of rainbow 3-term arithmetic progression-free $r$-colorings among all subsets of $[n]$. Moreover, the exact number of rainbow 3-term arithmetic progression-free $r$-colorings of $\mathbb{Z}_p$ is obtained, where $p$ is any prime and $\mathbb{Z}_p$ is the cyc…
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.
We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.
We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set $S\subseteq\mathbb{Z}_q^n$ containing $|S|=μ\cdot q^n$ elements must contain at least $δ(q,μ)\cdot q^n\cdot 2^n$ arithmetic progressions $x,x+d,\ldots,x+(q-1)\cdot d$ such that the difference $d$ is restricted to lie in $\{0,1\}^n$. Second, we show that for prime $p$ a symmetric set $S\subseteq\mathbb{F}^n_p$ with $|S|=μ\cdot p^n$ elements contains at least $μ^{C(p)}\cdot p^{2n}$ arithmetic progressions of length $p$. This establishes that …
Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We present a purely combinatorial argument which allows to derive this result directly from van der Waerden's Theorem.
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 least $c(\varepsilon)n^{2-\varepsilon}$ elements. We observe, by construction, that one can find $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences such that the cardinality of their union is $o(n^2)$. We refer also to the non-symmetric case of $n$ arithmetic progressions, each of length $\ell$, for various regimes of $n$ an…
We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications of this result to several questions in Ramsey theory.
A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper (i.e. collision-free) generalized arithmetic progressions, in both torsion-free and torsion settings. We also obtain a similar characterization of iterated sumsets in arbitrary abelian groups in terms of progressions, thus strengthening and extending recent results of Szemerédi and Vu.
We show that subsets of $\mathbb{F}_q^{\infty}$ of large Fourier dimension must contain three-term arithmetic progressions. This contrasts with a construction of Shmerkin of a subset of $\mathbb{R}$ of Fourier dimension $1$ with no three-term arithmetic progressions.
Carpi constructed an infinite word over a 4-letter alphabet that avoids squares in all subsequences indexed by arithmetic progressions of odd difference. We show a connection between Carpi's construction and the paperfolding words. We extend Carpi's result by constructing uncountably many words that avoid squares in arithmetic progressions of odd difference. We also construct infinite words avoiding overlaps and infinite words avoiding arbitrarily large squares in arithmetic progressions of odd difference. We use these words to construct labelings of the 2-dimensional integer lattice such that…
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We investigate the distributions of the number of: (1) monochromatic complete subgraphs over edgewise 2-colorings of complete graphs; and (2) monochromatic arithmetic progressions over 2-colorings of intervals, as statistical Ramsey theory questions. We present convincing evidence that both distributions are very well-approximated by the Delaporte distribution.
In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$ such that $i + k = 2j$ and $x_i + x_k = 2x_j$. We consider a few variations of the problem, discuss some related properties of double arithmetic progressions, and present several results obtained by using RamseyScript, a high-level scripting language.
A Generalisation of a Result on Monotone Arithmetic Progressions in Permutations of the Positive Integers
该论文推广了正整数排列中避免特定单调等差数列的构造，证明对任意k≥1，存在排列避免长度为4且公差不被2^k整除的等差数列。
In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.
Let the integers $1,\ldots,n$ be assigned colors. Szemerédi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let $f(n)$ be the smallest integer $k$ such that there is a coloring of $\{1, \ldots, n\}$ without totally multicolored arithmetic progressions of length three and such that each color appears on at most $k$ integers. We provide an exact value for $f(n)$ when $n$ is sufficiently large, and all extremal…
One of the toughest problems in Ramsey theory is to determine the existence of monochromatic arithmetic progressions in groups whose elements have been colored. We study the harder problem to not only determine the existence of monochromatic arithmetic progressions, but to also count them. We reformulate the enumeration in real algebraic geometry and then use state of the art computational methods in semidefinite programming and representation theory to derive sharp, or an explicit constant from sharp, lower bounds for the cyclic group of any order.
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.
Additive combinatorics is built around the famous theorem by Szemerédi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different techniques. Szemerédi's theorem is an existence statement, whereas the ultimate goal in combinatorics is always to make enumeration statements. In this article we develop new methods based on real algebraic geometry to obtain several quantitative statements on the number of arithmetic progressions in fixed density sets. We further discuss the possibility of a genera…
Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is still unsettled like J-sets, C-sets, D-sets etc. But all of these sets have a common property that they contains arbitrary length of arithmatic progressions. These type of sets are called sets of A.P. rich, we have given an elementary proof of abundance of those sets.
We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $ε>0$ such that one cannot find an arithmetic progression of length $k$ and gap length $Δ>0$ inside the $εΔ$ neighbourhood of $F$. Our main result is an explicit upper bound for the Assouad (and thus Hausdorff) dimension of such sets in terms of $k$ and $ε$. In the other direction, we provide examples of sets which uniformly avoid arithmetic progressions of a given length but…
On long arithmetic progressions in binary Morse-like words
本文研究了二进制Morse类词中的长等差数列存在性，提出了在Thue-Morse词及广义Thue-Morse词中的相关结果，其论证方法受启发于van der Waerden关于整数有限着色中单色等差数列存在性的证明。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。