Additive systems and a theorem of de Bruijn
Melvyn B. Nathanson

TL;DR
This paper provides a complete proof of de Bruijn's theorem classifying additive systems for nonnegative integers, identifying all indecomposable systems and their unique representations.
Contribution
It offers a comprehensive proof of de Bruijn's classification theorem and determines all indecomposable additive systems for nonnegative integers.
Findings
Complete proof of de Bruijn's theorem
Classification of all indecomposable additive systems
Unique representation of nonnegative integers
Abstract
This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families of sets of nonnegative integers, each set containing 0, such that every nonnegative integer can be written uniquely in the form with for all and for only finitely many . All indecomposable additive systems are determined.
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.
