首页 | 本学科首页   官方微博 | 高级检索  
     检索      


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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号