Related papers: Iterated Functions Systems, Blenders and Parablend…

In the present work, we study the attractors of iterated function systems (IFSs) on connected and compact metric spaces. We prove that the whole of the phase space of a forward minimal IFS, for which some map admits an attracting fixed…

S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…

We explain the construction of Forcer, a FORM program for the reduction of four-loop massless propagator-type integrals to master integrals. The resulting program performs parametric IBP reductions similar to the three-loop Mincer program.…

Transformer models have established new benchmarks in natural language processing; however, their increasing depth results in substantial growth in parameter counts. While existing recurrent transformer methods address this issue by…

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…

IFS fractals - the attractors of Iterated Function Systems - have motivated plenty of research to date, partly due to their simplicity and applicability in various fields, such as the modeling of plants in computer graphics, and the design…

The paper presents a survey over frame multipliers and related concepts. In particular, it includes a short motivation of why multipliers are of interest to consider, a review as well as extension of recent results, devoted to the…

We consider inference for a collection of partially observed, stochastic, interacting, nonlinear dynamic processes. Each process is identified with a label called its unit, and our primary motivation arises in biological metapopulation…

We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…

Using programmable network devices to aid in-network machine learning has been the focus of significant research. However, most of the research was of a limited scope, providing a proof of concept or describing a closed-source algorithm. To…

Paravectors just like integers have a ring structure. By introducing an integrated product we get geometric properties which make paravectors similar to vectors. The concepts of parallelism, perpendicularity and the angle are conceptually…

Our previous works presented zeta functions by the Konno-Sato theorem or the Fourier analysis for one-particle models including random walks, correlated random walks, quantum walks, and open quantum random walks. This paper introduces a new…

We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…

Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…

We develop a methodology to learn finitely generated random iterated function systems from time-series of partial observations using delay embeddings. We obtain a minimal model representation for the observed dynamics, using a hidden…

For an iterated function system (IFS) of simillitidues, we define two graphs on the representing symbolic space. We show that if the self-similar set $K$ has positive Lebesgue measure or the IFS satisfies the weak separation condition, then…

We introduce information bearing systems (IBRS) as an abstraction of many logical systems. We define a general semantics for IBRS, and show that IBRS generalize in a natural way preferential semantics and solve open representation problems.

We consider linear iterated function systems (IFS) with a constant contraction ratio in the plane for which the "overlap set" $\Ok$ is finite, and which are "invertible" on the attractor $A$, the sense that there is a continuous surjection…

We study the minimality of almost every orbital branch of minimal iterated function systems (IFSs). We prove that this kind of minimality holds for forward and backward minimal IFSs generated by orientation-preserving homeomorphisms of the…

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…