Algorithms to test open set condition for self-similar set related to P.V. numbers (Q401376): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:32, 30 January 2024
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