Algorithms to test open set condition for self-similar set related to P.V. numbers

Abstract: Fix a P.V. number

l a m b d a^{- 1} > 1.

Given

m a t h b f p = (p_{1}, c d o t s, p_{m}) i n m a t h b b N^{m}

,

, for the self-similar set

E_{m a t h b f p, m a t h b f b} = c u p_{i = 1}^{m} (l a m b d a^{p_{i}} E_{m a t h b f p, m a t h b f b} + b_{i})

we find an efficient algorithm to test whether

E_{m a t h b f p, m a t h b f b}

satisfies the open set condition (strong separation condition) or not.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: Algorithms to test open set condition for self-similar set related to P.V. numbers