We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get some structural properties of $A$, $B$ and $A+B$ when $λ(A+B)<λ(A)+λ(B)+\min(λ(A),λ(B))$. We also give some structural information for sets of large density with small sumset and characterize the extremal sets for which equality holds in the lower bounds for $λ(A+B)$.
Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan and the first author. We also classify those sets $A$ for which this bound cannot be improved.
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and this is just one example of a large family of results. Our aim in this paper is to investigate what happens if we restrict the number of elements of one set that we may use to form the sums. Here is the question we set out to answer: given two subsets, A and B, does B have a subset C of bounded size such that A+C is large, perhaps even comparable to the size…
Let $G = (G,+)$ be an additive group. The sumset theory of Plünnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$, while the inverse sumset theory of Freiman, Ruzsa, and others characterises those finite sets $A$ for which $A+A$ is small. In this paper we establish analogous results in which the finite set $A \subset G$ is replaced by a discrete random variable $X$ taking values in $G$, and the cardinality $|A|$ is replaced by the Shannon entropy $\mathrm{Ent}(X)$. In parti…
A remarkable theorem due to Khovanskii asserts that for any finite subset $A$ of an abelian group, the cardinality of the $h$-fold sumset $hA$ grows like a polynomial for all sufficiently large $h$. Currently, neither the polynomial nor what sufficiently large means are understood. In this paper we obtain an effective version of Khovanskii's theorem for any $A \subset \mathbb{Z}^d$ whose convex hull is a simplex; previously, such results were only available for $d=1$. Our approach gives information about not just the cardinality of $hA$, but also its structure, and we prove two effective theor…
In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this by allowing only a bounded number of possible summands from one of the sets. We show that if A and B are subsets of the integers of size k such that for any four-element subset X of B the sumset A+X has size not much more than 2k then already this implies that A and B are very close to arithmetic progressions.
Let $G = (G,+)$ be a compact connected abelian group, and let $μ_G$ denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath and Raikov) establishes the bound $$ μ_G(A + B) \geq \min( μ_G(A)+μ_G(B), 1 ) $$ whenever $A,B$ are compact subsets of $G$, and $A+B := \{ a+b: a \in A, b \in B \}$ denotes the sumset of $A$ and $B$. Clearly one has equality when $μ_G(A)+μ_G(B) \geq 1$. Another way in which equality can be obtained is when $A = ϕ^{-1}(I), B = ϕ^{-1}(J)$ for some continuous surjective homomorphism $ϕ: G \to {\bf R}/{\bf Z}$ and compact arcs $I,J …
An improved bound for sumsets of thick compact sets via the Shapley--Folkman theorem
Harvard Business School（哈佛商学院）；Department of Economics and Center of Mathematical Sciences and Applications, Harvard University（哈佛大学经济系与数学科学及应用中心）；a16z crypto（a16z加密）
We prove results on the structure of a subset of the circle group having positive inner Haar measure and doubling constant close to the minimum. These results go toward a continuous analogue in the circle of Freiman's $3k-4$ theorem from the integer setting. An analogue of this theorem in $\mathbb{Z}_p$ has been pursued extensively, and we use some recent results in this direction. For instance, obtaining a continuous analogue of a result of Serra and Zémor, we prove that if a subset $A$ of the circle is not too large and has doubling constant at most $2+\varepsilon$ with $\varepsilon<10^{-4}$…
For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $Σ_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small, $|Σ_n(S)|\leq |S|-n+1$, it is known that the terms of $S$ can be partitioned into $n$ nonempty sets $A_1,\ldots,A_n\subseteq G$ such that $Σ_n(S)=A_1+\ldots+A_n$. Moreover, if the upper bound is strict, then $|A_i\setminus Z|\leq 1$ for all $i$, where $Z=\bigcap_{i=1}^{n}(A_i+H)$ and $H=\{g\in G:\; g+Σ_n(S)=Σ_n(S)\}$ is the stabilizer of $Σ_n(S)$. This allows structu…
Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = Ω(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully contained in arithmetic progressions $P_1$ and $P_2$ with the same common difference and cardinalities approximately $s_i m/(s_1+s_2)$. We also prove a counting theorem for such pairs of sets in arbitrary abelian groups. The results hold for $s_i = ω(\log^3 n)$ and $s_1+s_2 \leq m = o(s_2/\log^3 n)$. Our main tool is an asymmetric version of the method of hyperg…
我们证明了Frieman的$3k-3$定理对于和集$$ Σ^{l}(A_1,\ldots,A_k)=\{a_{j_{1}}+\cdots+a_{j_{l}}:\,1\leq j_{1}<\cdots<j_{l}\leq k,\ a_{j_{s}}\in A_{j_{s}}\text{ for all }s\}. $$的一个推广
The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is covered by an arithmetic progression of size at most $|A|+r+1$. A theorem of Serra and Zémor proves the conjecture provided $r\leq 0.0001|A|$, without any additional constraint on $|A|$. Subject to the mild additional constraint $|2A|\leq 3p/4$ (which is optimal in a sense explained in the paper), our first main result improves the bound on $r$, allowing $r…
We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_ΓB$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As applications, we derive robust results with other types of assumptions on popular sums, and structure theorems for sets satisfying almost equalities in discrete and continuous versions of the Riesz-Sobolev inequality.
The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums and differences on $P$, that is, operations on the second coordinate when the first one is fixed, or vice versa. The structure we find is the zero set of a family of bilinear forms on a Cartesian product of vector subspaces. The codimensions of the subspaces and the number of bilinear forms involved are bounded by a function $c(δ)$ of the density $δ=\lvert P\r…
A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A corresponding stability theorem for sets whose sumset has nearly minimal measure is also proved, sharpening recent results of other authors. For the special case of the group $\mathbb{R}/\mathbb{Z}$, a continuous deformation of sets is developed, under which an appropriately scaled Riesz-Sobolev functional is shown to be nondecreasing.
For $δ>0$ sufficiently small and $A\subset \mathbb{Z}^k$ with $|A+A|\le (2^k+δ)|A|$, we show either $A$ is covered by $m_k(δ)$ parallel hyperplanes, or satisfies $|\widehat{\operatorname{co}}(A)\setminus A|\le c_kδ|A|$, where $\widehat{\operatorname{co}}(A)$ is the smallest convex progression (convex set intersected with a sublattice) containing $A$. This generalizes the Freiman-Bilu $2^k$ theorem, Freiman's $3|A|-4$ theorem, and recent sharp stability results of the present authors for sumsets in $\mathbb{R}^k$ conjectured by Figalli and Jerison.
The Minkowski sum of two subsets $A$ and $B$ of a finite abelian group $G$ is defined as all pairwise sums of elements of $A$ and $B$: $A + B = \{ a + b : a \in A, b \in B \}$. The largest size of a $(k, \ell)$-sum-free set in $G$ has been of interest for many years and in the case $G = \mathbb{Z}/n\mathbb{Z}$ has recently been computed by Bajnok and Matzke. Motivated by sum-free sets of the torus, Kravitz introduces the noisy Minkowski sum of two sets, which can be thought of as discrete evaluations of these continuous sumsets. That is, given a noise set $C$, the noisy Minkowski sum is define…
