ID: 2306.13403

Sumsets and entropy revisited

June 23, 2023

View on ArXiv
Ben Green, Freddie Manners, Terence Tao
Mathematics
Number Theory
Combinatorics

The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat better properties; for instance, it contracts upon applying a homomorphism. In this paper we develop further the theory of entropic doubling and give various applications, including: (1) A new proof of a result of P\'alv\"olgyi and Zhelezov on the ``skew dimension'' of subsets of $\mathbf{Z}^D$ with small doubling; (2) A new proof, and an improvement, of a result of the second author on the dimension of subsets of $\mathbf{Z}^D$ with small doubling; (3) A proof that the Polynomial Freiman--Ruzsa conjecture over $\mathbf{F}_2$ implies the (weak) Polynomial Freiman--Ruzsa conjecture over $\mathbf{Z}$.

Similar papers 1

Sumset and inverse sumset theorems for Shannon entropy

June 24, 2009

91% Match
Terence Tao
Combinatorics
Probability

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke 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 v...

Find SimilarView on arXiv

On an entropic analogue of additive energy

June 27, 2024

87% Match
Marcel K. Goh
Combinatorics
Number Theory

Recent advances have linked various statements involving sumsets and cardinalities with corresponding statements involving sums of random variables and entropies. In this vein, this paper shows that the quantity $2{\bf H}\{X, Y\} - {\bf H}\{X+Y\}$ is a natural entropic analogue of the additive energy $E(A,B)$ between two sets. We develop some basic theory surrounding this quantity, and demonstrate its role in the proof of Tao's entropy variant of the Balog--Szemer\'edi--Gower...

Find SimilarView on arXiv

Asymptotic formula for sum-free sets in abelian groups

July 13, 2005

86% Match
R. Balasubramanian, Gyan Prakash
Number Theory

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes the number $ n^{-1}(\log_2 |SF(G)|) $. In this article we shall improve the error term in the asymptotic formula of $\sigma(G)$ which was obtained recently by Ben Green and Ruzsa. The methods used are a slight refinement of methods develop...

Find SimilarView on arXiv

On sets with small doubling

March 11, 2007

85% Match
I. D. Shkredov
Number Theory
Combinatorics

Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the article we prove that if we have some minor restrictions on K then for any set with small doubling there exists a set Lambda, |Lambda| << K log |A| such that |A\cap Lambda| >> |A| / K^{1/2 + c}, where c > 0. In contrast to the previous res...

Find SimilarView on arXiv

Dimension growth for iterated sumsets

February 9, 2018

85% Match
Jonathan M. Fraser, Douglas C. Howroyd, Han Yu
Metric Geometry
Classical Analysis and ODEs

We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$. Our results apply to, for example, all uniformly perfect sets, which include Ahlfors-David regular sets. Our proofs rely on Hochman's inverse theorem for entropy and the Assouad and lower dimensions play a critical role. We give several app...

Find SimilarView on arXiv

Small subsets with large sumset: Beyond the Cauchy--Davenport bound

October 13, 2022

85% Match
Jacob Fox, Sammy Luo, ... , Zhou Yunkun
Combinatorics
Number Theory

For a subset $A$ of an abelian group $G$, given its size $|A|$, its doubling $\kappa=|A+A|/|A|$, and a parameter $s$ which is small compared to $|A|$, we study the size of the largest sumset $A+A'$ that can be guaranteed for a subset $A'$ of $A$ of size at most $s$. We show that a subset $A'\subseteq A$ of size at most $s$ can be found so that $|A+A'| = \Omega(\min(\kappa^{1/3},s)|A|)$. Thus a sumset significantly larger than the Cauchy--Davenport bound can be guaranteed by a...

Find SimilarView on arXiv

Structure Theory of Set Addition III. Results and Problems

April 24, 2012

84% Match
Gregory A. Freiman
Number Theory

We are discussing the theorem about the volume of a set $A$ of $Z^n$ having a small doubling property $|2A| < Ck, k=|A|$ and oher problems of Structure Theory of Set Addition (Additive Combinatorics).

Find SimilarView on arXiv

Projections, Entropy and Sumsets

November 7, 2007

84% Match
Paul Balister, Béla Bollobás
Combinatorics
Number Theory
Probability

In this paper we have shall generalize Shearer's entropy inequality and its recent extensions by Madiman and Tetali, and shall apply projection inequalities to deduce extensions of some of the inequalities concerning sums of sets of integers proved recently by Gyarmati, Matolcsi and Ruzsa. We shall also discuss projection and entropy inequalities and their connections.

Find SimilarView on arXiv

Entropy versions of additive inequalities

September 27, 2018

84% Match
Alberto Espuny Díaz, Oriol Serra
Combinatorics
Information Theory
Information Theory

The connection between inequalities in additive combinatorics and analogous versions in terms of the entropy of random variables has been extensively explored over the past few years. This paper extends a device introduced by Ruzsa in his seminal work introducing this correspondence. This extension provides a toolbox for establishing the equivalence between sumset inequalities and their entropic versions. It supplies simpler proofs of known results and opens a path for obtain...

Find SimilarView on arXiv

Finding a low-dimensional piece of a set of integers

December 19, 2015

84% Match
Freddie Manners
Combinatorics
Number Theory

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of as a major quantitative improvement on Fre\u{i}man's dimension lemma, or as a "weak" Fre\u{i}man--Ruzsa theorem with almost polynomial bounds. The methods used, centered around an "additive energy increment strategy", differ from the usual...

Find SimilarView on arXiv