Integer complexity: representing numbers of bounded defect

, and this author showed that the set of all defects is a well-ordered subset of the real numbers. This was accomplished by showing that for a fixed real number

r

, there is a finite set

S

of polynomials called "low-defect polynomials" such that for any

n

with

d e l t a (n) < r

,

n

has the form

f (3^{k_{1}}, l d o t s, 3^{k_{r}}) 3^{k_{r + 1}}

for some

f i n S

. However, using the polynomials produced by this method, many extraneous

n

with

d e l t a (n) g e r

would also be represented. In this paper we show how to remedy this and modify

S

so as to represent precisely the

n

with

d e l t a (n) < r

and remove anything extraneous. Since the same polynomial can represent both

n

with

d e l t a (n) < r

and

n

with

d e l t a (n) g e r

, this is not a matter of simply excising the appropriate polynomials, but requires "truncating" the polynomials to form new ones.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Integer complexity: representing numbers of bounded defect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338388)