pith. sign in

arxiv: 1710.08353 · v1 · pith:K2R6K3K6new · submitted 2017-10-23 · 🧮 math.NT · cs.DM· cs.FL· math.CO

When is an automatic set an additive basis?

classification 🧮 math.NT cs.DMcs.FLmath.CO
keywords additivebasisautomaticnaturalnumbersadditionalgorithmcharacterization
0
0 comments X
read the original abstract

We characterize those $k$-automatic sets $S$ of natural numbers that form an additive basis for the natural numbers, and we show that this characterization is effective. In addition, we give an algorithm to determine the smallest $j$ such that $S$ forms an additive basis of order $j$, if it exists.

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.