Bounds on the number of maximal sum-free sets |
| |
Authors: | Guy Wolfovitz |
| |
Institution: | aDepartment of Computer Science, Haifa University, Haifa, Israel |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|