Erdos showed that every set of n positive integers contains a subset of size at least n/(k + 1) containing no solutions to x(1) + ... + x(k) = y. We prove that the constant 1/(k + 1) here is best possible by showing that is (F-m) is a Multiplicative Folner sequence in N, then F-m has no k-sum-free subset of size greater than (1/(k + 1) + 0(1))|F-m|.
机构:
Huazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Peoples R ChinaHuazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Peoples R China
Wen, Zhi-Xiong
Zhang, Jie-Meng
论文数: 0引用数: 0
h-index: 0
机构:
Huazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Peoples R ChinaHuazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Peoples R China
Zhang, Jie-Meng
Wu, Wen
论文数: 0引用数: 0
h-index: 0
机构:
Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Peoples R China
Univ Oulu, Dept Math Sci, Oulu 90014, FinlandHuazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Peoples R China
机构:
Univ Victor Segalen Bordeaux 2, Equipe Stat Mathemat & Applicat, EA 2961, F-33076 Bordeaux, France
Univ Bordeaux 1, UMR 5465, A2X, F-33405 Talence, France
CNRS, F-33405 Talence, FranceUniv Victor Segalen Bordeaux 2, Equipe Stat Mathemat & Applicat, EA 2961, F-33076 Bordeaux, France
Deshouillers, Jean-Marc
Freiman, Gregory A.
论文数: 0引用数: 0
h-index: 0
机构:
Tel Aviv Univ, Tel Aviv, IsraelUniv Victor Segalen Bordeaux 2, Equipe Stat Mathemat & Applicat, EA 2961, F-33076 Bordeaux, France