Related papers: Fractal squares with finitely many connected compo…
We discuss the formation of stochastic fractals and multifractals using the kinetic equation of fragmentation approach. We also discuss the potential application of this sequential breaking and attempt to explain how nature creats fractals.
We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic $(n_3)$ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability.…
For a given pcf self-similar fractal, a certain network (weighted graph) is constructed whose ideal boundary is (homeomorphic to) the fractal. This construction is the first representation of a connected self-similar fractal as the boundary…
We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these non-physical maps. They find applications in the design of direct entanglement detection methods. We show that many of…
Given a multi-valued function $\Phi$ on a topological space $X$ we study the properties of its fixed fractal, which is defined as the closure of the orbit $\Phi^\omega(Fix(\Phi))=\bigcup_{n\in\omega}\Phi^n(Fix(\Phi))$ of the set…
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
The paper concerns fractal homeomorphism between the attractors of two bi-affine iterated function systems. After a general discussion of bi-affine functions, conditions are provided under which a bi-affine iterated function system is…
We derive a general framework that connects every positive map with a corresponding witness for partial separability in multipartite quantum systems. We show that many previous approaches were intimately connected to the witnesses derived…
We estimate a Box-counting dimension of fractal surfaces which are generated by iterated function systems with a vertical contraction factor function on an arbitrary data set over rectangular grids and can express well a lot of natural…
The fractal properties of four-dimensional Euclidean simplicial manifold generated by the dynamical triangulation are analyzed on the geodesic distance D between two vertices instead of the usual scale between two simplices. In order to…
When plane waves diffract through fractal-patterned apertures, the resulting far-field profiles or diffractals also exhibit iterated, self-similar features. Here we show that this specific architecture enables robust signal processing and…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
While self-similar sets have no tangents at any single point, self-affine curves can be smooth. We consider plane self-affine curves without double points and with two pieces. There is an open subset of parameter space for which the curve…
In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
Traditional studies of chaos in conservative and driven dissipative systems have established a correspondence between sensitive dependence on initial conditions and fractal basin boundaries, but much less is known about the relation between…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…