2000 character limit reached
Additive systems and a theorem of de Bruijn
Published 26 Jan 2013 in math.NT and math.CO | (1301.6208v2)
Abstract: This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families $\mca = (A_i){i\in I}$ of sets of nonnegative integers, each set containing 0, such that every nonnegative integer can be written uniquely in the form $\sum{i\in I} a_i$ with $a_i \in A_i$ for all $i$ and $a_i \neq 0$ for only finitely many $i$. All indecomposable additive systems are determined.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.