Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Bertran Steinsky"'
Autor:
Bertran Steinsky, Ligia L. Cristea
Labyrinth fractals are self-similar fractals that were introduced and studied in recent work by Cristea and Steinsky. In the present paper we define and study more general objects, called mixed labyrinth fractals, that are in general not self-similar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3246781f9edadce7f1e6d4069da9778
http://arxiv.org/abs/2009.12206
http://arxiv.org/abs/2009.12206
Publikováno v:
Aequationes mathematicae. 85:201-219
The well known planar fractal called the Sierpinski gasket can be defined with the help of a related sequence of graphs {G n } n ≥ 0, where G n is the n-th Sierpinski graph, embedded in the Euclidean plane. In the present paper we prove geometric c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac027e73f267175c5c4dc99c43f326e0
https://doi.org/10.1007/s00010-013-0197-7
https://doi.org/10.1007/s00010-013-0197-7
Autor:
Bertran Steinsky, Ligia-Loreta Cristea
Publikováno v:
Proceedings of the Edinburgh Mathematical Society. 54:329-344
We define an infinite class of fractals, called horizontally and vertically blocked labyrinth fractals, which are dendrites and special Sierpiński carpets. Between any two points in the fractal there is a unique arc α; the length of α is infinite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1616f03d053fb4a58e6747327c1a340b
https://doi.org/10.1017/s0013091509000169
https://doi.org/10.1017/s0013091509000169
Autor:
Bertran Steinsky, Ligia L. Cristea
Publikováno v:
Geometriae Dedicata. 141:1-17
We study 4 × 4-labyrinth fractals, which are self similar dendrites. For all 4 × 4-labyrinth fractals we answer the question, whether there is a curve of finite length in the fractal from one point to another point in the fractal. In the first case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5c6179f053c1e7ca3a1581a52f4fe13
https://doi.org/10.1007/s10711-008-9340-3
https://doi.org/10.1007/s10711-008-9340-3
Autor:
Bertran Steinsky, Peter J. Grabner
Publikováno v:
aequationes mathematicae. 70:268-278
Let z k be the k-th zero of $$\phi (z) = {\sum\nolimits_{n = 0}^\infty {\frac{{{\left( { - z} \right)}^{n} }}{{n!2{\left( {\begin{array}{*{20}c} {n} \\ {2} \\ \end{array}} \right)}}}} }$$ sorted increasingly by modulus from the origin, for k ≥ 0. $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5562f20e8e1aa589b02ab4f004244022
https://doi.org/10.1007/s00010-005-2806-6
https://doi.org/10.1007/s00010-005-2806-6
Autor:
Bertran Steinsky
Publikováno v:
Discrete Mathematics. 270:267-278
A chain graph is a digraph whose strong components are undirected graphs and a directed acyclic graph (ADG or DAG) G is essential if the Markov equivalence class of G consists of only one element. We provide recurrence relations for counting labelled
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b892de34dc443661d328b73905273550
https://doi.org/10.1016/s0012-365x(02)00838-5
https://doi.org/10.1016/s0012-365x(02)00838-5
Autor:
Bertran Steinsky
Publikováno v:
Soft Computing - A Fusion of Foundations, Methodologies and Applications. 7:350-356
We use an adaptation of the Prufer code for trees to encode labeled directed acyclic graphs, which are often abbreviated to DAGs (or ADGs). In this paper, each DAG is assigned a unique DAG code, which allows an easy handling for several purposes. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::608fa8d2784af89375b58e3c20802a86
https://doi.org/10.1007/s00500-002-0223-5
https://doi.org/10.1007/s00500-002-0223-5
Autor:
Bertran Steinsky, Ligia L. Cristea
Publikováno v:
Topology and its Applications. (7):1157-1162
Generalised Sierpinski carpets are planar sets that generalise the well-known Sierpinski carpet and are defined by means of sequences of patterns. We present necessary and sufficient conditions, under which generalised Sierpinski carpets are connecte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cd51d7bca1715943966dc6afcfb6f36