On additive complements in the complement of a set of natural numbers
Bhuwanesh Rao Patil, Mohan

TL;DR
This paper investigates the existence of sparse additive complements within the complement of a set of natural numbers, providing a ratio test to determine when such complements exist based on the growth rate of the set.
Contribution
It introduces a ratio test criterion for the existence of sparse additive complements in the complement of a set of natural numbers, extending previous results on additive complements.
Findings
Existence of sparse additive complements under certain growth conditions
A ratio test criterion for verifying the existence of such complements
Proof that if the set's elements grow faster than a certain rate, complements exist
Abstract
Let be a set of natural numbers. A set , a set of natural numbers, is an additive complement of the set if all sufficiently large natural numbers can be represented in the form , where and . Erd\H{o}s proposed a conjecture that every infinite set of natural numbers has a sparse additive complement, and in 1954, Lorentz proved this conjecture. This article describes the existence or non-existence of those additive complements of the set that is a subset of the complement of . We provide a ratio test to verify the existence of such additive complements. In precise, we prove that if is a set of natural numbers such that for and , then there exists a set such that is a sparse additive complement of the…
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
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
