Related papers: A countable fractal interpolation scheme involving…
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$. The…
Recently, in [Electronic Transaction on Numerical Analysis, 41 (2014), pp. 420-442] authors introduced a new class of rational cubic fractal interpolation functions with linear denominators via fractal perturbation of traditional…
In this study we provide several significant generalisations of Banach contraction principle where the Lipschitz constant is substituted by real-valued control function that is a comparison function. We study non-stationary variants of…
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is…
We describe new families of random fractals, referred to as "V-variable", which are intermediate between the notions of deterministic and of standard random fractals. The parameter V describes the degree of "variability" : at each…
We review aspects of an important paper by Robert Strichartz concerning reverse iterated function systems (i.f.s.) and fractal blowups. We compare the invariant sets of reverse i.f.s. with those of more standard i.f.s. and with those of…
The intention of this article is to introduce a generalization of Proinov-type contraction via simulation functions. We name this generalized contraction map as Proinov-type Z-contraction. This article establishes the existence and…
We construct an iterated function system consisting of strictly increasing contractions $f,g\colon [0,1]\to [0,1]$ with $f([0,1])\cap g([0,1])=\emptyset$ and such that its attractor has positive Lebesgue measure.
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…
This study develops a comprehensive theoretical and computational framework for Random Nonlinear Iterated Function Systems (RNIFS), a generalization of classical IFS models that incorporates both nonlinearity and stochasticity. We establish…
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…
Numerical interpolation techniques are widely employed for calculating large rational functions in scattering amplitude computations. It has been observed in recent years that these rational functions greatly simplify upon partial…
We evaluate the correlation function of the spectral staircase and use it to evaluate the mesoscopic particle number fluctuations in integrable systems.
Properties of the phase space of the standard map with memory are investigated. This map was obtained from a kicked fractional differential equation. Depending on the value of the parameter of the map and the fractional order of the…
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.
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…
This paper sets a theoretical foundation for the applications of the fractal interpolation functions (FIFs). We construct rational cubic spline FIFs (RCSFIFs) with quadratic denominator involving two shape parameters. The elements of the…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
We consider some random iterated function systems on the interval and show that the invariant measure has density in $\mathcal{C}^\infty$. To prove this we use some techniques for contractions in cone metrics, applied to the transfer…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.