On Erd\H{o}s and S\'ark\"ozy's sequences with Property P
Christian Elsholtz, Stefan Planitzer

TL;DR
This paper constructs an infinite set of positive integers with Property P, improving the lower bound on its counting function compared to previous examples by Erdős and Sárközy.
Contribution
The authors explicitly construct an infinite set with Property P that has a significantly improved lower bound on its counting function.
Findings
Constructed an infinite set with Property P.
Achieved a lower bound on the counting function involving iterated logarithms.
Improved upon Erdős and Sárközy's earlier bounds.
Abstract
A sequence of positive integers having the property that no element divides the sum of two larger elements is said to have `Property P'. We construct an infinite set having Property P with counting function . This improves on an example given by Erd\H{o}s and S\'ark\"ozy with a lower bound on the counting function of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Graph Labeling and Dimension Problems
