THE MAXIMUM SIZE OF -SUM-FREE SETS IN CYCLIC GROUPS
2018 ◽
Vol 99
(2)
◽
pp. 184-194
Keyword(s):
A subset$A$of a finite abelian group$G$is called$(k,l)$-sum-free if the sum of$k$(not necessarily distinct) elements of$A$never equals the sum of$l$(not necessarily distinct) elements of $A$. We find an explicit formula for the maximum size of a$(k,l)$-sum-free subset in$G$for all$k$and$l$in the case when$G$is cyclic by proving that it suffices to consider$(k,l)$-sum-free intervals in subgroups of $G$. This simplifies and extends earlier results by Hamidoune and Plagne [‘A new critical pair theorem applied to sum-free sets in abelian groups’,Comment. Math. Helv. 79(1) (2004), 183–207] and Bajnok [‘On the maximum size of a$(k,l)$-sum-free subset of an abelian group’,Int. J. Number Theory 5(6) (2009), 953–971].
2015 ◽
Vol 24
(4)
◽
pp. 609-640
◽
Keyword(s):
2016 ◽
Vol 160
(3)
◽
pp. 495-512
◽
2005 ◽
Vol 71
(3)
◽
pp. 487-492
Keyword(s):
Keyword(s):
1981 ◽
Vol 90
(2)
◽
pp. 273-278
◽
Keyword(s):
1981 ◽
Vol 33
(4)
◽
pp. 817-825
◽
Keyword(s):
1960 ◽
Vol 12
◽
pp. 447-462
◽
Keyword(s):