Additive systems and a theorem of de Bruijn
Abstract
This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families = (Ai)i∈ I of sets of nonnegative integers, each set containing 0, such that every nonnegative integer can be written uniquely in the form Σi∈ I ai with ai ∈ Ai for all i and ai ≠ 0 for only finitely many i. All indecomposable additive systems are determined.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.