Related papers: A fractal set from the binary reflected Gray code
Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times. This…
Modularization is a cornerstone of computer science, abstracting complex functions into atomic building blocks. In this paper, we introduce a new level of modularization by abstracting generative models into atomic generative modules.…
Bacteria light harvesters are interpreted as Vicsek fractal, based upon their morphology, even though such fractals contain only one, or perhaps two, generations. After using fractal dimensions to describe the geometry, we progress to use…
Dynamic unary encoding takes unary encoding to the next level. Every n-bit binary string is an encoding of dynamic unary and every n-bit binary string is encodable by dynamic unary. By utilizing both forms of unary code and a single bit of…
The study of human dynamics has attracted much interest from many fields recently. In this paper, the fractal characteristic of human behaviors is investigated from the perspective of time series constructed with the amount of library…
Linear binary fragmentation of synthetic fractal-like agglomerates composed of spherical, equal-size, touching monomers is numerically investigated. Agglomerates of different morphologies are fragmented via random bond removal. The…
One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…
In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to…
The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…
To help understand the underlying mechanisms of neural networks (NNs), several groups have, in recent years, studied the number of linear regions $\ell$ of piecewise linear functions generated by deep neural networks (DNN). In particular,…
We present an experimental spectroscopic study of large random colloidal aggregates of silver nanoparticles undergoing local restructuring. We argue that such well-known phenomena as strong fluctuation of local electromagnetic fields,…
The self-similar structure of the attracting subshift of a primitive substitution is carried over to the limit set of the repelling tree in the boundary of Outer Space of the corresponding irreducible outer automorphism of a free group.…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
We define fractal continuations and the fast basin of the IFS and investigate which properties they inherit from the attractor. Some illustrated examples are provided.
A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…
Fractal behaviour, i.e. scale invariance in spatio-temporal dynamics, have been found to describe and model many systems in nature, in particular fluid mechanics and geophysical related geometrical objects, like the convective boundary…
This paper explores features of an idealized mathematical machine (algorithm) that would be capable of reconstructing the gravitational nature (the multipolar structure or spacetime metric) of a compact object, by observing gravitational…
We investigate compositional iteration of fractional order for transseries. For any large positive transseries $T$ of exponentiality 0, there is a family $T^{[s]}$ indexed by real numbers $s$ corresponding to teration of order $s$. It is…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…