Related papers: Self-similar resistive circuits as fractal-like st…
We propose two new kinds of infinite resistor networks based on the Fibonacci sequence: a serial association of resistor sets connected in parallel (type 1) or a parallel association of resistor sets connected in series (type 2). We show…
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 extend Feynman's analysis of an infinite ladder circuit to fractal circuits, providing examples in which fractal circuits constructed with purely imaginary impedances can have characteristic impedances with positive real part. Using…
In this paper, we present high-level overviews of tile-based self-assembling systems capable of producing complex, infinite, aperiodic structures known as discrete self-similar fractals. Fractals have a variety of interesting mathematical…
We study the convergence of resistance metrics and resistance forms on a converging sequence of spaces. As an application, we study the existence and uniqueness of self-similar Dirichlet forms on Sierpinski gaskets with added rotated…
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 extend Feynman's analysis of the infinite ladder AC circuit to fractal AC circuits. We show that the characteristic impedances can have positive real part even though all the individual impedances inside the circuit are purely imaginary.…
The Sierpinski Triangle (ST) is a fractal mathematical structure that has been used to explore the emergence of flat bands in lattices of different geometries and dimensions in condensed matter. Here we look into fractal features in the…
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…
The self-similarity properties of fractals are studied in the framework of the theory of entire analytical functions and the $q$-deformed algebra of coherent states. Self-similar structures are related to dissipation and to noncommutative…
The relative configurational entropy per cell as a function of length scale is a sensitive detector of spatial self-similarity. For Sierpinski carpets the equally separated peaks of the above function appear at the length scales that depend…
In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…
We consider a trace theorem for self-similar Dirichlet forms on self-similar sets to self-similar subsets. In particular, we characterize the trace of the domains of Dirichlet forms on the Sierpinski gaskets and the Sierpinski carpets to…
Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were…
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a…
We demonstrate existence of a tile assembly system that self-assembles the statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile Assembly Model. This appears to be the first paper that considers self-assembly of a…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
This paper gives a (polynomial time) algorithm to decide whether a given Discrete Self-Similar Fractal Shape can be assembled in the aTAM model.In the positive case, the construction relies on a Self-Assembling System in the aTAM which…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
This paper studies the concept of power dissipation in infinite graphs and fractals associated with passive linear networks consisting of non-dissipative elements. In particular, we analyze the so-called Feynman-Sierpinski ladder, a fractal…