Related papers: On the chaos game of Iterated Function Systems
Moran-type iterated function systems (Moran-type IFS or MIFS) are defined by a sequence of iterated function systems, and their basic theoretical framework is established. We define Moran-type attractors and invariant probability measures…
We study a setting in which two players play a (possibly approximate) Nash equilibrium of a bimatrix game, while a learner observes only their actions and has no knowledge of the equilibrium or the underlying game. A natural question is…
We consider invertible linear maps with additive spherical bounded noise. We show that minimal attractors of such random dynamical systems are unique, strictly convex and have a continuously differentiable boundary. Moreover, we present an…
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the…
We consider the family of CIFSs of generalized complex continued fractions with a complex parameter space. This is a new interesting example to which we can apply a general theory of infinite CIFSs and analytic families of infinite CIFSs.…
A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb{R}^d$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the…
In 1996, Strichartz introduced reverse iterated function systems (RIFS) $\mathcal{F}=\{f_i(x)=r_i x+b_i\}_{i=1}^m$ of expanding mappings on $\mathbb{Z}$ and left the determination of the general dimension formulas of invariant sets as an…
In this paper we study random iterated function systems. Our main result gives sufficient conditions for an analogue of a well known theorem due to Khintchine from Diophantine approximation to hold almost surely for stochastically…
We consider infinite graph-directed iterated function systems (GIFSs) whose contraction mappings are nonconformal. As our main result, we formulate asymptotic perturbations from conformal GIFSs to nonconformal GIFSs, and give the asymptotic…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
A badly approximable system of affine forms is determined by a matrix and a vector. We show Kleinbock's conjecture for badly approximable systems of affine forms: for any fixed vector, the set of badly approximable systems of affine forms…
We introduce and develop a class of \textit{Cantor-winning} sets that share the same amenable properties as the classical winning sets associated to Schmidt's $(\alpha,\beta)$-game: these include maximal Hausdorff dimension, invariance…
This work deals with the time evolution of the Hamming distance density for the public goods game. We consider distinct possibilities for this game, which are exactly described by a function called $q$-exponential, that represents a…
In this note we give a simple sufficient condition for an affine iterated function system to admit an invariant affine subspace persistently with respect to changes in the translation parameters. This yields further examples of tuples of…
A growing number of machine learning architectures, such as Generative Adversarial Networks, rely on the design of games which implement a desired functionality via a Nash equilibrium. In practice these games have an implicit complexity…
This article is talking about the study constructive method of structural identification systems with chaotic dynamics. It is shown that the reconstructed attractors are a source of information not only about the dynamics but also on the…
We explore and refine techniques for estimating the Hausdorff dimension of exceptional sets and their diffeomorphic images. Specifically, we use a variant of Schmidt's game to deduce the strong C^1 incompressibility of the set of badly…
We study the dimension theory of limit sets of iterated function systems consisting of a countably infinite number of contractions. Our primary focus is on the intermediate dimensions: a family of dimensions depending on a parameter $\theta…
We introduce the discrete version of the Hutchinson--Barnsley theory providing algorithms to approximate the Hutchinson measure for iterated function systems (IFS) and generalized iterated function systems (GIFS) complementing the discrete…
This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant…