Related papers: Fractal squares with finitely many connected compo…
In \cite{LaLuRa13}, the authors completely classified the topological structure of so called {\it fractal square} $F$ defined by $F=(F+{\mathcal D})/n$, where ${\mathcal{D}}\subsetneq\{0,1,\dots,n-1\}^2, n\ge 2$. In this paper, we further…
The study of Lipschitz equivalence of fractals is a very active topic in recent years. Most of the studies in literature concern totally disconnected fractals. In this paper, using finite state automata, we construct a bi-Lipschitz map…
We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
The fractal nature of graphs has traditionally been investigated by using the nodes of networks as the basic units. Here, instead, we propose to concentrate on the graph edges, and introduce a practical and computationally not demanding…
A fractal surface is a set which is a graph of a bivariate continuous function. In the construction of fractal surfaces using IFS, vertical scaling factors in IFS are important one which characterizes a fractal feature of surfaces…
This paper concerns the local connectedness of components of self-similar sets. Given an equal partition of the unit square into n*n small squares, we may choose arbitrarily two or more of them and form an iterated function system. The…
Given an integer $n\geq 2$ and a digit set ${\mathcal D}\subsetneq {0,1,...,n-1}^2$, there is a self-similar set $F \subset {\Bbb R}^2$ satisfying the set equation: $F=(F+{\mathcal D})/n$. We call such $F$ a fractal square. By studying a…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We prove that every Peano continuum with uncountably many local cut points is a topological fractal. This extends some recent results and it partially answers a conjecture by Hata. We also discuss the number of mappings which are necessary…
This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with…
There are three important types of structural properties that remain unchanged under the structural transformation of condensed matter physics and chemistry. They are the properties that remain unchanged under the structural periodic…
Fractal geometry deals mainly with irregularity and captures the complexity of a structure or phenomenon. In this article, we focus on the approximation of set-valued functions using modern machinery on the subject of fractal geometry. We…
A finitely generated solvable group with unbounded iterated identity is constructed.
Over the past three decades, describing the reality surrounding us using the language of complex networks has become very useful and therefore popular. One of the most important features, especially of real networks, is their complexity,…
A fractal is in essence a hierarchy with cascade structure, which can be described with a set of exponential functions. From these exponential functions, a set of power laws indicative of scaling can be derived. Hierarchy structure and…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
We show that a fractal cube $F$ in $\mathbb R^3$ may have an uncountable set $Q$ of connected components $K_\alpha$ neither of which is contained in any plane, whereas the set $Q$ is a totally disconnected self-similar subset of the…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…