Sum-avoiding sets in groups

DOI10.19086/DA.887MaRDI QIDQ2826221zbMATH OpenOpenAlexFDO

Authors Van Vu, Terence Tao

Publication date 10 October 2016

Published in Discrete Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1603.03068

zbMATH Keywords

nonstandard analysissum-avoiding setssum-free sets

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10) Arithmetic combinatorics; higher degree uniformity (11B30) Mixed groups (20K21)

Abstract: 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}otinA$ for all distinct $b_1,b_{2}inB$). The question of controlling the size of $A$ in terms of $phi(A)$ in the case when $G$ was torsion-free was posed by ErdH{o}s and Moser. When $G$ has torsion, $A$ can be arbitrarily large for fixed $phi(A)$ due to the presence of subgroups. Nevertheless, we provide a qualitative answer to an analogue of the ErdH{o}s-Moser problem in this setting, by establishing a structure theorem, which roughly speaking asserts that $A$ is either efficiently covered by $phi(A)$ finite subgroups of $G$, or by fewer than $phi(A)$ finite subgroups of $G$ together with a residual set of bounded cardinality. In order to avoid a large number of nested inductive arguments, our proof uses the language of nonstandard analysis. We also answer negatively a question of ErdH{o}s regarding large subsets $A$ of finite additive groups $G$ with $phi(A)$ bounded, but give a positive result when $|G|$ is not divisible by small primes.

Recommendations

• On a question of Erdős and Moser
• The Erdős-Moser sum-free set problem
• Sum-avoiding subsets
• Sum-free sets in groups: a survey
• scientific article; zbMATH DE number 4183487

Cites work

• A statistical theorem of set addition
• A variant of the hypergraph removal lemma
• Additive combinatorics
• An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
• Finding linear patterns of complexity one
• Freiman's theorem in an arbitrary abelian group
• scientific article; zbMATH DE number 3232871 (Why is no real title available?)
• scientific article; zbMATH DE number 3103684 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Introduction of nonstandard methods for number theorists
• John-type theorems for generalized arithmetic progressions and iterated sumsets
• Linear equations in primes
• Note on the 3-graph counting Lemma
• On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
• On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• On a question of Erdős and Moser
• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
• On strongly sum-free subsets of abelian groups
• On the removal lemma for linear systems over abelian groups
• Probabilistic construction of small strongly sum-free sets via large Sidon sets
• Sum-avoiding subsets
• The counting lemma for regular k‐uniform hypergraphs
• The Largest Sum-Free Subsequence from a Sequence of n Numbers
• The primes contain arbitrarily long arithmetic progressions
• The structure of approximate groups.

Cited in

(10)

• Gregory's sixth operation
• Cauchy's infinitesimals, his sum theorem, and foundational paradigms
• Sumsets in dihedral groups.
• Sum-free sets in groups: a survey
• Strong characterizing sequences of countable groups
• Small oscillations of the pendulum, Euler's method, and adequality
• The Erdős-Moser sum-free set problem
• The largest (k,)-sum-free sets in compact Abelian groups
• A non-standard analysis of a cultural icon: the case of Paul Halmos
• scientific article; zbMATH DE number 2188479 (Why is no real title available?)

This page was built for publication: Sum-avoiding sets in groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826221)