Related papers: How many times can a function be iterated?
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
We study iterated function systems (IFS) with compact parameter space. We show that the space of IFS with phase space $X$ is the hyperspace of the space of self continuous maps of $X$. With this result we obtain that the Hausdorff distance…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…
Let E be a topological space and F a uniform space. We introduce a new topology (in fact a uniform structure) called the V-congergence on the space of applications from E to F such that C(E,F) is closed for this topology and the restriction…
In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach,…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
We study the convergence of stochastic fixed point iterations in the consistent case (in the sense of Butnariu and Fl{\aa}m (1995)) in several different settings, under decreasingly restrictive regularity assumptions of the fixed point…
In this paper, we investigate parameter families of iterated function systems and continuity. Specifically, if we have a set of iterated function systems that depend continuously on a parameter, which properties of the invariant sets will…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…
Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…
In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set…
Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…
Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…
In this paper we continue our research of functions on the boundary of their domain and obtain some results on cluster sets of functions between topological spaces. In particular, we prove that for a metrizable topological space $X$, a…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
In this paper we continue to study the property of separability of functional space C(X) with the open-point and bi-point-open topologies.
Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders cells of the input complex in a way which eliminates some…