ID: 1404.2044

Additive dimension and a theorem of Sanders

April 8, 2014

View on ArXiv

Similar papers 2

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

Some new inequalities in additive combinatorics

August 11, 2012

82% Match
I. D. Shkredov
Combinatorics

In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian group. We apply the inequalities to obtain new upper bounds for the additive energy of multiplicative subgroups and convex sets and also a series another results on the connection of the additive energy and so--called higher moments of convolutions. Besides we prove new theorems on multiplicative subgroups concerning lower bounds for its doubling consta...

Find SimilarView on arXiv

Sum-avoiding sets in groups

March 9, 2016

82% Match
Terence Tao, Van Vu
Combinatorics

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$). The question of controlling the size of $A$ in terms of $\phi(A)$ in the case when $G$ was torsion-free was posed by Erd\H{o}s and Moser. When $G$ has torsion, $A$ can be arbitrarily large for fixed $\phi(A)$ due to the presence of subgroups....

Find SimilarView on arXiv

On additive doubling and energy

February 29, 2008

82% Match
Nets Hawk Katz, Paul Koester
Combinatorics
Classical Analysis and ODEs

We show that if A is a set having small subtractive doubling in an abelian group, that is |A-A|< K|A|, then there is a polynomially large subset B of A-A so that the additive energy of B is large than (1/K)^{1 - \epsilon) where epsilon is a positive, universal exponent. (1/37 seems to suffice.)

Find SimilarView on arXiv

On a theorem of Shkredov

July 31, 2008

82% Match
Tom Sanders
Classical Analysis and ODEs

We show that if A is a finite subset of an abelian group with additive energy at least c|A|^3 then there is a subset L of A with |L|=O(c^{-1}\log |A|) such that |A \cap Span(L)| >> c^{1/3}|A|.

Find SimilarView on arXiv

Asymptotic formula for sum-free sets in abelian groups

July 13, 2005

81% 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 a Theorem of Deshouillers and Freiman

September 23, 2013

81% Match
R. Balasubramanian, Prem Prakash Pandey
Combinatorics

The study of `structure' on subsets of abelian groups, with small `doubling constant', has been well studied in the last fifty years, from the time Freiman initiated the subject. In \cite{DF} Deshouillers and Freiman establish a structure theorem for subsets of $\n$ with small doubling constant. In the current article we provide an alternate proof of one of the main theorem of \cite{DF}. Also our proof leads to slight improvement of the theorems in \cite{DF}.

Find SimilarView on arXiv

Sets with large additive energy and symmetric sets

April 14, 2010

81% Match
Ilya Shkredov, Sergey Yekhanin
Combinatorics

We show that for any set A in a finite Abelian group G that has at least c |A|^3 solutions to a_1 + a_2 = a_3 + a_4, where a_i belong A there exist sets A' in A and L in G, |L| \ll c^{-1} log |A| such that A' is contained in Span of L and A' has approximately c |A|^3 solutions to a'_1 + a'_2 = a'_3 + a'_4, where a'_i belong A'. We also study so-called symmetric sets or, in other words, sets of large values of convolution.

Find SimilarView on arXiv

Note on the Theorem of Balog, Szemer\'edi, and Gowers

August 20, 2023

81% Match
Christian Reiher, Tomasz Schoen
Combinatorics
Number Theory

We prove that every additive set $A$ with energy $E(A)\ge |A|^3/K$ has a subset $A'\subseteq A$ of size $|A'|\ge (1-\varepsilon)K^{-1/2}|A|$ such that $|A'-A'|\le O_\varepsilon(K^{4}|A'|)$. This is, essentially, the largest structured set one can get in the Balog-Szemer\'edi-Gowers theorem.

Find SimilarView on arXiv

Energies and structure of additive sets

May 13, 2014

81% Match
Ilya D. Shkredov
Combinatorics
Number Theory

In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we give criteria for a set to be a 1) set of the form H+L, where H+H is small and L has "random structure", 2) set equals a disjoint union of sets H_j, each H_j has small doubling, 3) set having large subset A' with 2A' is equal to a set with ...

Find SimilarView on arXiv