Related papers: A code space for a generalized IFS
We consider a class of iterated function systems (IFSs) of contracting similarities of $R^n$, introduced by Hutchinson, for which the invariant set possesses a natural H\"older continuous parameterization by the unit interval. When such an…
The aim of this study is to clarify the consequences of recent theoretical results for the numerical computation of expectation by the shift method, and in particular to yield sufficient criteria for the existence of speed of convergence of…
This thesis presents a series of theoretical results and practical realisations about the theory of computation in distributive categories. Distributive categories have been proposed as a foundational tool for Computer Science in the last…
In this paper we prove a generalization of Istr\u{a}\c{t}escu's theorem for convex contractions. More precisely, we introduce the concept of iterated function system consisting of convex contractions and prove the existence and uniqueness…
In this paper a systematic study of the category GTS of generalized topological spaces (in the sense of H. Delfs and M. Knebusch) and their strictly continuous mappings begins. Some completeness and cocompleteness results are achieved.…
We associate to each iterated function system consisting of phi-max-contractions an operator (on the space of continuous functions from the shift space on the metric space corresponding to the system) having a unique fixed point whose image…
A common task in computational text analyses is to quantify how two corpora differ according to a measurement like word frequency, sentiment, or information content. However, collapsing the texts' rich stories into a single number is often…
A finite family $\mathcal{F}=\{f_1,\ldots,f_n\}$ of continuous selfmaps of a given metric space $X$ is called an iterated function system (shortly IFS). In a case of contractive selfmaps of a complete metric space is well-known that IFS has…
In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a…
The present work is concerned with the eqiucontinuity and sensitivity of iterated function systems (IFSs). Here, we consider more general case of IFSs, i.e. the IFSs generated by a family of relations. We generalize the concepts of…
We provide a new algorithm to generate images of the generalized fuzzy fractal attractors described in Oliveira-2017. We also provide some important results on the approximation of fractal operators to discrete subspaces with application to…
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 ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…
We take a fresh look at the classical problem of runs in a sequence of i.i.d.\ coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types. This generalizes and unifies…
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…
We generalize the notion of the auto-Igusa zeta function to formal deformations of algebraic spaces. By incorporating data from all algebraic transformations of local coordinates, this function can be viewed as a generalization of the…
Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…
We describe in this article a new code for evolving axisymmetric isolated systems in general relativity. Such systems are described by asymptotically flat space-times which have the property that they admit a conformal extension. We are…
We show that here standard decoding algorithms for generic linear codes over a finite field can speeded up by a factor which is essentially the size of the finite field by reducing it to a low weight codeword problem and working in the…
In this work, we modify the decoding algorithm for subspace codes by Koetter and Kschischang to get a decoding algorithm for (generalized) twisted Gabidulin codes. The decoding algorithm we present applies to cases where the code is linear…