Related papers: A code space for a generalized IFS
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…
In this paper we show how to approximate ("learn") a function f, where X and Y are metric spaces.
In this work we propose a definition of an Euroattractor: an attracting invariant measure of a certain iterated functions system (IFS). An IFS is defined by specifying a set of functions, defined in subsets of R^N or in a classical phase…
A principal shift invariant subspace of $L^{2}(\IR)$ is isometric to a weighted norm space $L^{2}(\IT, w)$. Using results obtained earlier by the author on the basis properties of subsystems of the trigonometric system in the weighted norm…
The ramification method in Implicit Computational Complexity has been associated with functional programming, but adapting it to generic imperative programming is highly desirable, given the wider algorithmic applicability of imperative…
The aim of this paper is to construct a fractal with the help of a finite family of generalized F-contraction mappings, a class of mappings more general than contraction mappings, defined in the setup of b-metric space. Consequently, we…
We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an…
In this paper, we consider a wider class of simulation functions and present some coincidence and common fixed point results in metric spaces. Results obtained in this paper extend, generalize and unify some well-known fixed and common…
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…
We study locally constant skew-product maps over full shifts of finite symbols with arbitrary compact metric spaces as fiber spaces. We introduce a new criterion to determine the density of leaves of the strong unstable (and strong stable)…
In this paper we extend previous work on IFSs without overlap. Our method involves systems of operators generalizing the more familiar Cuntz relations from operator algebra theory, and from subband filter operators in signal processing.
Let $X$ be a Banach space and $f,g:X\rightarrow X$ be contractions. We investigate the set $$ C_{f,g}:=\{w\in X:\m{ the attractor of IFS }\F_w=\{f,g+w\}\m{ is connected}\}. $$ The motivation for our research comes from papers of Mihail and…
The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics. We start showing that the classical definitions of shifts of finite type and sofic shifts, as…
In this paper an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Some applications of this method to approximation of distribution…
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.
Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…
We give a description of the category structure of the space of generalized connections, an extension of the space of connections that plays a central role in loop quantum gravity.
Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity of the functions in the IFS has been central to the theory of iterated functions systems.…
The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…