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 , answering a question of Cameron, and that the number of those contained in the cyclic group of order is exponential in . For primes , we provide a full characterization of the symmetric complete sum-free subsets of of size at least , where is a universal constant.
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