On the number of sum-free triplets of sets

被引:0
作者
Araujo, Igor [1 ]
Balogh, Jozsef [1 ]
Garcia, Ramon, I [1 ]
机构
[1] Univ Illinois, Dept Math, Urbana, IL 61801 USA
关键词
INDEPENDENT SETS;
D O I
10.37236/10170
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 subset of Z/pZ for which the equation a + b = c has no solution with a is an element of A, b is an element of B and c is an element of 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 Csikvari 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.
引用
收藏
页码:1 / 17
页数:17
相关论文
共 9 条
[1]  
[Anonymous], 2012, PROC NEURAL INF PROC
[2]   Sharp bound on the number of maximal sum-free subsets of integers [J].
Balogh, Jozsef ;
Liu, Hong ;
Sharifzadeh, Maryam ;
Treglown, Andrew .
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2018, 20 (08) :1885-1911
[3]  
Balogh J, 2015, J AM MATH SOC, V28, P669
[4]  
Csikvari Peter, ARXIV161201295V2
[5]   Sum-free sets in abelian groups [J].
Green, B .
ISRAEL JOURNAL OF MATHEMATICS, 2005, 147 (1) :157-188
[6]   An entropy approach to the hard-core model on bipartite graphs [J].
Kahn, J .
COMBINATORICS PROBABILITY & COMPUTING, 2001, 10 (03) :219-237
[7]   Counting independent sets in cubic graphs of given girth [J].
Perarnau, Guillem ;
Perkins, Will .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 133 :211-242
[8]   Hypergraph containers [J].
Saxton, David ;
Thomason, Andrew .
INVENTIONES MATHEMATICAE, 2015, 201 (03) :925-992
[9]   Number of A plus B ≠ C solutions in abelian groups and application to counting independent sets in hypergraphs [J].
Semchankau, Aliaksei ;
Shabanov, Dmitry ;
Shkredov, Ilya .
EUROPEAN JOURNAL OF COMBINATORICS, 2022, 100