𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Equations over Sets of Natural Numbers

✍ Scribed by Artur Jeż; Alexander Okhotin


Publisher
Springer
Year
2009
Tongue
English
Weight
559 KB
Volume
48
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On Infinite Sum-free Sets of Natural Num
✍ Tomasz łuczak; Tomasz Schoen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1Â(k+1) is a subset of a periodic k-sum-free set a