On function $SX$ of additive complements
Jin-Hui Fang, Csaba S\'andor

TL;DR
This paper investigates the function SX related to perfect additive complements of nonnegative integers, determining its exact value and bounds, thus advancing understanding of the structure of such complements.
Contribution
The paper precisely determines the value of SX for perfect additive complements and establishes the absolute lower bound for SX among additive complements.
Findings
Calculated the exact value of SX for perfect additive complements.
Established the absolute lower bound of SX for additive complements.
Fixed the infimum of SX for perfect additive complements.
Abstract
Two sets of nonnegative integers are called \emph{additive complements}, if all sufficiently large integers can be expressed as the sum of two elements from and . We further call \emph{perfect additive complements} if every nonnegative integer can be uniquely expressed as the sum of two elements from and . Let be the counting function of . In this paper, we focus on the function , where was introduced by Erd\H{o}s and Freud in 1984. As a main result, we determine the value of for perfect additive complements and further fix the infimum. We also give the absolute lower bound of for additive complements.
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
TopicsRings, Modules, and Algebras · Advanced Algebra and Logic · Fuzzy and Soft Set Theory
