English

Symmetric Complete Sum-free Sets in Cyclic Groups

Combinatorics 2017-05-02 v2 Group Theory Number Theory

Abstract

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in [0,13][0,\frac{1}{3}], answering a question of Cameron, and that the number of those contained in the cyclic group of order nn is exponential in nn. For primes pp, we provide a full characterization of the symmetric complete sum-free subsets of Zp\mathbb{Z}_p of size at least (13c)p(\frac{1}{3}-c) \cdot p, where c>0c>0 is a universal constant.

Keywords

Cite

@article{arxiv.1703.04118,
  title  = {Symmetric Complete Sum-free Sets in Cyclic Groups},
  author = {Ishay Haviv and Dan Levy},
  journal= {arXiv preprint arXiv:1703.04118},
  year   = {2017}
}

Comments

20 pages, 2 figures

R2 v1 2026-06-22T18:43:28.457Z