Algorithms to test open set condition for self-similar set related to P.V. numbers (Q401376)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms to test open set condition for self-similar set related to P.V. numbers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms to test open set condition for self-similar set related to P.V. numbers |
scientific article |
Statements
Algorithms to test open set condition for self-similar set related to P.V. numbers (English)
0 references
26 August 2014
0 references
Fix any Pisot number \(1/b>1\), define an IFS \(\{S(i):i+1,\dots,m\}\), where each \(S(i)\) is a contractive similitude on the \(d\)-dimensional space with a contracting ratio of some power of \(b\). Let \(E\) be the invariant set of the IFS. The authors give an algorithm to test whether the IFS satisfies the open set condition.
0 references
fractal
0 references
self-similar set
0 references
open set condition
0 references
Pisot number
0 references
0 references
