On the number of sum-free triplets of sets
Combinatorics
2021-08-20 v2
Abstract
We count the ordered sum-free triplets of subsets in the group , i.e., the triplets of sets for which the equation has no solution with , and . Our main theorem improves on a recent result by Semchankau, Shabanov, and Shkredov using a different and simpler method. Our proof relates previous results on the number of independent sets of regular graphs by Kahn, Perarnau and Perkins, and Csikv\'ari to produce explicit estimates on smaller order terms. We also obtain estimates for the number of sum-free triplets of subsets in a general abelian group.
Keywords
Cite
@article{arxiv.2101.05914,
title = {On the number of sum-free triplets of sets},
author = {Igor Araujo and József Balogh and Ramon I. Garcia},
journal= {arXiv preprint arXiv:2101.05914},
year = {2021}
}
Comments
13 pages, 4 figures (including appendix)