On the number of sum-free triplets of sets
Abstract
We count the ordered sum-free triplets of subsets in the group Z/pZ, i.e., the triplets (A,B,C) of sets A,B,C ⊂ Z/pZ for which the equation a+b=c has no solution with a∈ A, b ∈ B and c ∈ C. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.