pith. sign in

arxiv: 1301.6208 · v2 · pith:XJH2KT6Snew · submitted 2013-01-26 · 🧮 math.NT · math.CO

Additive systems and a theorem of de Bruijn

classification 🧮 math.NT math.CO
keywords additivenonnegativesystemsbruijnintegerstheoremclassifiescomplete
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Additive systems for $\mathbb{Z}$ are undecidable

    math.CO 2025-08 unverdicted novelty 8.0

    The problem of whether the sumset of a canonical collection covers all of Z is undecidable for a well-behaved family of collections, by equivalence to the universal halting problem for Fractran.