The number of additive triples in subsets of abelian groups

DOI10.1017/S0305004115000821zbMATH Open1371.11030arXiv1507.03764MaRDI QIDQ5360385FDOQ5360385

Authors: Wojciech Samotij, Benny Sudakov 

Publication date: 28 September 2017

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Abstract: A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements $x,y,z$ with $x+y=z$. The study of how large the largest sum-free subset of a given abelian group is had started more than thirty years before it was finally resolved by Green and Ruzsa a decade ago. We address the following more general question. Suppose that a set $A$ of elements of an abelian group $G$ has cardinality $a$. How many Schur triples must $A$ contain? Moreover, which sets of $a$ elements of $G$ have the smallest number of Schur triples? In this paper, we answer these questions for various groups $G$ and ranges of $a$.

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

Recommendations

• Sums of triples in Abelian groups
• The number of sumsets in abelian group
• The number of \(k\)-sumsets in an abelian group
• The number of sum-free sets in abelian groups
• Subset sums in abelian groups
• On the number of subgroups of finite abelian groups
• On the number of subgroups of finite abelian groups
• scientific article; zbMATH DE number 1059208
• The multisubset sum problem for finite abelian groups

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30) Inverse problems of additive number theory, including sumsets (11P70)

Cites Work

• Abschätzung der asymptotischen Dichte von Summenmengen
• Explicit construction of linear sized tolerant networks
• The number of cliques in graphs of given order and size
• Title not available (Why is that?)
• Extremal problems among subsets of a set
• The minimum number of disjoint pairs in set systems and related problems
• Sum-free sets in Abelian groups.
• Supersaturated graphs and hypergraphs
• On the Minimal Density of Triangles in Graphs
• Title not available (Why is that?)
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• Title not available (Why is that?)
• On small sumsets in an abelian group
• On the number of complete subgraphs and circuits contained in graphs
• Maximal sum-free sets in finite abelian groups
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On the Ramsey multiplicity of complete graphs
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Sperner's theorem and a problem of Erdős, Katona and Kleitman
• Title not available (Why is that?)
• On a theorem of Rademacher-Turán
• Sum-free sets in abelian groups
• A Generalisation of the Theorem of Cauchy and Davenport
• The minimum number of monotone subsequences
• On the number of monotone sequences
• Supersaturation in the Boolean lattice
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Equality in Pollard's theorem on set addition of congruence classes
• Maximal sum-free sets of elements of finite groups
• Sets of integers with no large sum-free subset
• Sum-free sets in vector spaces over \(GF(2)\)
• Binary set functions and parity check matrices
• Maximal sum-free sets in finite abelian groups, V
• Title not available (Why is that?)

Cited In (7)

• The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\)
• The maximum size of \((k,l)\)-sum-free sets in cyclic groups
• Structure and supersaturation for intersecting families
• On tripling constant of multiplicative subgroups
• The Schur degree of additive sets
• Supersaturation in posets and applications involving the container method
• Minimum number of additive tuples in groups of prime order

This page was built for publication: The number of additive triples in subsets of abelian groups

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