When is an automatic set an additive basis?

10/23/2017
by   Jason Bell, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2021

The geometry of non-additive stabiliser codes

We present a geometric framework for constructing additive and non-addit...
research
04/07/2019

Semi-Countable Sets and their Application to Search Problems

We present the concept of the information efficiency of functions as a t...
research
01/07/2023

On the Weihrauch degree of the additive Ramsey theorem

We characterize the strength, in terms of Weihrauch degrees, of certain ...
research
07/08/2019

The Haar System in Triebel-Lizorkin Spaces: Endpoint Results

We determine for which parameters natural enumerations of the Haar syste...
research
10/05/2011

Linearized Additive Classifiers

We revisit the additive model learning literature and adapt a penalized ...
research
06/18/2019

Improper vs finitely additive distributions as limits of countably additive probabilities

In Bayesian statistics, improper distributions and finitely additive pro...
research
02/01/2021

Monotone additive statistics

We study statistics: mappings from distributions to real numbers. We cha...

Please sign up or login with your details

Forgot password? Click here to reset