Related papers: A Random Multifractal Tilling
If a point particle moves chaotically through a periodic array of scatterers the associated transport coefficients are typically irregular functions under variation of control parameters. For a piecewise linear two-parameter map we analyze…
Random Wavelet Series form a class of random processes with multifractal properties. We give three applications of this construction. First, we synthesize a random function having any given spectrum of singularities satisfying some…
We achieve the multifractal analysis of a class of complex valued statistically self-similar continuous functions. For we use multifractal formalisms associated with pointwise oscillation exponents of all orders. Our study exhibits new…
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…
Finite automata were used to determine multiple addresses in number systems and to find topological properties of self-affine tiles and finite type fractals. We join these two lines of research by axiomatically defining automata which…
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 calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…
We consider an optical diffraction grating in which the spatial distribution of open slits forms a fractal set. The Fraunhofer diffraction patterns through the fractal grating are obtained analytically for the simplest triad Cantor type and…
We reveal the fractal nature of patterns arising in random sequential adsorption of particles with continuum power-law size distribution, $P(R)\sim R^{\alpha-1}$, $R \le R_{\rm max}$. We find that the patterns become more and more ordered…
The top of the attractor $A$ of a hyperbolic iterated function system $\left\{ f_{i}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,2,\dots,M\right\} $ is defined and used to extend self-similar tilings to overlapping systems. The theory…
We give an exact formula for the number of distinct square patterns of a given size that occur in the Squiral tiling.
We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…
In this paper we obtain the density function and the distribution function of the distance between two uniformly and independently distributed random points in any right-angled triangle. The density function is derived from the chord length…
Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
We consider the concept of fractons, i.e. particles or quasiparticles which obey specific fractal distribution function and for each universal class h of particles we obtain a fractal-deformed Heisenberg algebra. This one takes into account…
Random recursive hypergraphs grow by adding, at each step, a vertex and an edge formed by joining the new vertex to a randomly chosen existing edge. The model is parameter-free, and several characteristics of emerging hypergraphs admit neat…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
Classical problem of random triangle in square is solved by simple and transparent geometrical method.
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…