Counting non-standard binary representations

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Abstract: Let

m a t h c a l A

be a finite subset of

m a t h b b N

including

0

and

f_{m} a t h c a l A (n)

be the number of ways to write

n = s u m_{i = 0}^{i n f t y} e p s i l o n_{i} 2^{i}

, where

e p s i l o n_{i} i n m a t h c a l A

. We consider asymptotics of the summatory function

s_{m} a t h c a l A (r, m)

of

f_{m} a t h c a l A (n)

from

m 2^{r}

to

m 2^{r + 1} - 1

and show that

s_{m a t h c a l A} (r, m) a p p r o x c (m a t h c a l A, m) l e f t | m a t h c a l A i g h t |^{r}

for some

c (m a t h c a l A, m) i n m a t h b b Q

.

Recommendations

Cited in

(5)

This page was built for publication: Counting non-standard binary representations