Bounds on the Number of Maximal Sum-Free Sets

We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-free subsets of any group of order n.

• Type: Journal
• Year: 2007
• Where: ENDM
• Authors: Guy Wolfovitz
• Keywords: ENDM 2007, Maximal Product-free Subsets, Maximal Sum-free Subsets, Upper Bound