Sciweavers

ENDM
2007
60views more  ENDM 2007»
14 years 12 days ago
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-...
Guy Wolfovitz