کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9516858 | 1633123 | 2005 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Separation properties for graph-directed self-similar fractals
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
هندسه و توپولوژی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Examples of “separation properties” for iterated function systems of similitudes include: the open set condition, the weak separation property, finite type. Alternate descriptions for these properties and relations among these properties have been worked out. Here we consider the same situation for “graph-directed” iterated function systems, and provide the definitions and proofs for that setting. We deal with the case of strongly connected graphs. In many cases the definitions (and proofs) are much like the one-node case. But sometimes we have found changes were needed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Topology and its Applications - Volume 152, Issues 1â2, 1 July 2005, Pages 138-156
Journal: Topology and its Applications - Volume 152, Issues 1â2, 1 July 2005, Pages 138-156
نویسندگان
Manav Das, G.A. Edgar,