2000 character limit reached
A Note on the Alon-Kleitman Argument for Sum-free Subset Theorem
Published 23 Jun 2016 in math.CO and cs.DM | (1606.07823v2)
Abstract: In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>\frac{2}{7}n. In this note, we show that the argument confused two different randomness. It applies only to the finite Abelian group G = (Z/pZ)s where p is a prime. For the general case, the problem remains open.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.