ID: 0802.4371

On additive doubling and energy

February 29, 2008

View on ArXiv

Similar papers 5

Sums, Differences and Dilates

February 28, 2024

83% Match
Jonathan Cutler, Luke Pebody, Amites Sarkar
Combinatorics

Given a set of integers $A$ and an integer $k$, write $A+k\cdot A$ for the set $\{a+kb:a\in A,b\in A\}$. Hanson and Petridis showed that if $|A+A|\le K|A|$ then $|A+2\cdot A|\le K^{2.95}|A|$. At a presentation of this result, Petridis stated that the highest known value for $\frac{\log(|A+2\cdot A|/|A|)}{\log(|A+A|/|A|)}$ (bounded above by 2.95) was $\frac{\log 4}{\log 3}$. We show that, for all $\epsilon>0$, there exist $A$ and $K$ with $|A+A|\le K|A|$ but with $|A+2\cdot A|...

Find SimilarView on arXiv

On Isoperimetric Stability

September 16, 2017

82% Match
Vsevolod F. Lev
Combinatorics
Number Theory

We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with respect to $S$ does not exceed $(1-\gamma)|S||A|$ with a real $\gamma\in(0,1]$, then $|A| \ge 4^{(1-1/d)\gamma |S|}$, where $d$ is the smallest order of an element of $S$. Here the constant $4$ is best possible. As a corollary, we derive an...

Find SimilarView on arXiv

Some remarks on the distribution of additive energy

December 14, 2022

82% Match
Norbert Hegyvári
Combinatorics
Number Theory

The aim of this note is two-fold. In the first part of the paper we are going to investigate an inverse problem related to additive energy. In the second, we investigate how dense a subset of a finite structure can be for a given additive energy.

Find SimilarView on arXiv

New bounds in the Bogolyubov-Ruzsa lemma

November 7, 2023

82% Match
Tomasz Kosciuszko, Tomasz Schoen
Combinatorics
Number Theory

We establish new bounds in the Bogolyubov-Ruzsa lemma, demonstrating that if A is a subset of a finite abelian group with density alpha, then 3A-3A contains a Bohr set of rank O(log^2 (2/alpha)) and radius Omega(log^{-2} (2/alpha)). The Bogolyubov-Ruzsa lemma is one of the deepest results in additive combinatorics, with a plethora of important consequences. In particular, we obtain new results toward the Polynomial Freiman-Ruzsa conjecture and improved bounds in Freiman's the...

Find SimilarView on arXiv

Large sets with small doubling modulo p are well covered by an arithmetic progression

April 6, 2008

82% Match
Oriol Serra, Gilles Zémor
Number Theory

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic progression of length |2S|-|S|+1. This is the first result of this nature which places no unnecessary restrictions on the size of S.

Find SimilarView on arXiv

A quadratic lower bound for subset sums

December 2, 2006

82% Match
Matt Simon Fraser University DeVos, Luis Simon Fraser University Goddyn, ... , Samal Robert Simon Fraser University
Number Theory

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer of \Sigma(A). Our result implies that \Sigma(A) = Z/nZ for every set A of units of Z/nZ with |A| >= 8 \sqrt{n}. This consequence was first proved by Erd\H{o}s and Heilbronn for n prime, and by Vu (with a weaker constant) for general n.

Find SimilarView on arXiv

A short note on the multiplicative energy of the spectrum of a set

May 26, 2018

82% Match
Ilya D. Shkredov
Number Theory
Combinatorics

We obtain an upper bound for the multiplicative energy of the spectrum of an arbitrary set from $\mathbb{F}_p$, which is the best possible up to the results on exponential sums over subgroups.

Find SimilarView on arXiv

On entropy Marton-type inequalities and small symmetric differences with cosets of abelian groups

June 16, 2024

82% Match
Thomas Karam
cs.IT
math.CO
math.GR
math.IT
math.NT
math.PR

We recognise that an entropy inequality akin to the main intermediate goal of recent works (Gowers, Green, Manners, Tao [3],[2]) regarding a conjecture of Marton provides a black box from which we can also through a short deduction recover another description: if a finite subset $A$ of an abelian group $G$ is such that the distribution of the sums $a+b$ with $(a,b) \in A \times A$ is only slightly more spread out than the uniform distribution on $A$, then $A$ has small symmet...

Find SimilarView on arXiv

Large values of the additive energy in R^d and Z^d

August 9, 2013

82% Match
Xuancheng Shao
Combinatorics

Combining Freiman's theorem with Balog-Szemeredi-Gowers theorem one can show that if an additive set has large additive energy, then a large piece of the set is contained in a generalized arithmetic progression of small rank and size. In this paper, we prove the above statement with the optimal bound for the rank of the progression. The proof strategy involves studying upper bounds for additive energy of subsets of R^d and Z^d.

Find SimilarView on arXiv

On the structure of the spectrum of small sets

April 4, 2015

82% Match
Kaave Hosseini, Shachar Lovett
Combinatorics

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime $|A| = |G|^\alpha $ whenever $\alpha \le c$, where $c \ge 1/2$ is some absolute constant. On the other hand, there are statistical results, which apply only to a noticeable fraction of the elements, which give nontrivial bounds even to much sm...

Find SimilarView on arXiv