Probability Theory and Applications 1992
DOI: 10.1007/978-94-011-2817-9_21
|View full text |Cite
|
Sign up to set email alerts
|

Number Systems and Fractal Geometry

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2004
2004
2011
2011

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Our construction will also give a clear characterisation of simultaneous number systems, as defined in [5]. Among others, we obtain an easy proof of the following, where we use a recent theorem on products of linear polynomials independently due to Kane [6] and Pethő [11].…”
Section: Introductionmentioning
confidence: 89%
“…Our construction will also give a clear characterisation of simultaneous number systems, as defined in [5]. Among others, we obtain an easy proof of the following, where we use a recent theorem on products of linear polynomials independently due to Kane [6] and Pethő [11].…”
Section: Introductionmentioning
confidence: 89%
“…Firstly, a, b, c are associated with 1, 2, 3, andȧ,ḃ,ċ with 4, 5, 6, since the underlying elements of R are exactly P, Q, N, −P, −Q, −N . Secondly, 7,8,9,10,11,12 are associated with c, b, a,ċ,ḃ,ȧ respectively, as the states 7, . .…”
Section: The Relation To the Recurrent Set Methodsmentioning
confidence: 99%
“…Thus the boundary of T is the attractor of this graph iterated function system (see [8,20]). G(R) is usually smaller than the boundary GIFS encountered in the literature [12,14,23,28]. Indeed, the set of states of the latter consists of all the neighbors of T , that is, the tiles T + s with T ∩ (T + s) = ∅.…”
Section: G(r) and The Boundary Parametrizationmentioning
confidence: 99%
“…Then k ∈ S if and only if x m = k for some m (2ω k + 1) n , where U , B and ω k were given in the statements just before Lemma 2.1 After we obtained Theorem 2.1, we became aware that Indlekofer, Kátai and Racskó had a theorem [12,Theorem 1] in the special case of complex number systems, corresponding to a special class of 2 × 2 integral expansive matrices and certain digit sets, early in 1992, which is analogous to our Theorem 2.1. We also found out that Kovacs had a related result for general integral expansive matrices from which the inclusion S ⊂ −K ∩ Z n can be deduced [15,Theorem 2].…”
Section: Introductionmentioning
confidence: 99%