The number of additive triples in subsets of abelian groups

preprint2016arXivOpen access

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,zx,y,z with x+y=zx+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 AA of elements of an abelian group GG has cardinality aa. How many Schur triples must AA contain? Moreover, which sets of aa elements of GG have the smallest number of Schur triples? In this paper, we answer these questions for various groups GG and ranges of aa.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.