Related papers: A code space for a generalized IFS
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…
In this paper, we deal with the part of Fractal Theory related to finite families of (weak) contractions, called iterated function systems (IFS, herein). An attractor is a compact set which remains invariant for such a family. Thus, we…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
We study the space spanned by the integer shifts of a bivariate Gaussian function and the problem of reconstructing any function in that space from samples scattered across the plane. We identify a large class of lattices, or more generally…
Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…
In this work we present iterated function systems with general measures(IFSm) formed by a set of maps $\tau_{\lambda}$ acting over a compact space $X$, for a compact space of indices, $\Lambda$. The Markov process $Z_k$ associated to the…
Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated function system (IFS) corresponding to the data set is the graph of the FIF. Coalescence…
The action of the Bernstein operators on Schur functions was given in terms of codes in [CG] and extended to the analog in Schur Q-functions in [HJS]. We define a new combinatorial model of extended codes and show that both of these results…
In this paper we consider Iterated Function Systems (IFS) on the real line consisting of continuous piecewise linear functions. We assume some bounds on the contraction ratios of the functions, but we do not assume any separation condition.…
Robots learn reward functions from user demonstrations, but these rewards often fail to generalize to new environments. This failure occurs because learned rewards latch onto spurious correlations in training data rather than the underlying…
This paper discusses, certain algebraic, analytic, and topological results on partial iterated function systems($IFS_p$'s). Also, the article proves the Collage theorem for partial iterated function systems. Further, it provides a method to…
Many machine learning methods assume that the training and test data follow the same distribution. However, in the real world, this assumption is very often violated. In particular, the phenomenon that the marginal distribution of the data…
Much of the structure in metric spaces that allows for the creation of fractals exists in more generalized non-metrizable spaces. In particular the same theorems regarding the behavior of compact sets can be proven in the more general…
A storage code is an assignment of symbols to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors, or more generally, of a certain neighborhood of the…
Using valuation rings and valued fields as examples, we discuss in which ways the notions of "topological IFS attractor" and "fractal space" can be generalized to cover more general settings.
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
Let $\{S_i\}_{i=1}^\ell$ be an iterated function system (IFS) on $\R^d$ with attractor $K$. Let $(\Sigma,\sigma)$ denote the one-sided full shift over the alphabet $\{1,..., \ell\}$. We define the projection entropy function $h_\pi$ on the…
The classical concept of affine locally symmetric spaces allows a generalization for various geometric structures on a smooth manifold. We remind the notion of symmetry for parabolic geometries and we summarize the known facts for…