arXiv Analytics

Sign in

arXiv:1301.6208 [math.NT]AbstractReferencesReviewsResources

Additive systems and a theorem of de Bruijn

Melvyn B. Nathanson

Published 2013-01-26, updated 2013-04-12Version 2

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.

Comments: 12 pages, revised
Journal: American Mathematical Monthly 121 (2014), 5--17
Categories: math.NT, math.CO
Subjects: 11A05, 11B75
Related articles: Most relevant | Search more
arXiv:1305.3001 [math.NT] (Published 2013-05-14, updated 2017-08-04)
Limits and decomposition of de Bruijn's additive systems
arXiv:2210.09680 [math.NT] (Published 2022-10-18)
On function $SX$ of additive complements
arXiv:1911.03968 [math.NT] (Published 2019-11-10)
The fastest series for $1/π$ due to Ramanujan. (A complete proof using Maple)