Related papers: Finite random iterated function systems do not alw…

The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…

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…

This paper considers the egodicity properties in iterated function systems. First, we will introduce chain mixing and chain transitive iterated function systems then some results and examples are presented to compare with these notions in…

For all Einstein-Podolsky-Rosen-type experiments on deterministic systems the Bell inequality holds, unless non-local interactions exist between certain parts of the setup. Here we show that in nonlinear systems the Bell inequality can be…

We show that there exists a bitsequence that is not computably random for which its odd bits are computably random and its even bits are computably random relative to the odd bits. This implies that the uniform variant of van Lambalgen's…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

We construct a wavelet and a generalised Fourier basis with respect to some fractal measures given by one-dimensional iterated function systems. In this paper we will not assume that these systems are given by linear contractions…

Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…

Knuth shows that iterations of a random function perform poorly on average as a random number generator. He proposes a generalization in which the next value depends on two or more previous values. This note demonstrates, via an analysis of…

A randomised trapezoidal quadrature rule is proposed for continuous functions which enjoys less regularity than commonly required. Indeed, we consider functions in some fractional Sobolev space. Various error bounds for this randomised rule…

Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…

We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps. Our primary focus is on finite invariant sets exhibiting ``toss-and-catch'' dynamics, in which trajectories alternate…

The method of refined algebraic quantization of constrained systems which is based on modification of the inner product of the theory rather than on imposing constraints on the physical states is generalized to the case of constrained…

B-terms are built from the B combinator alone defined by B f g x = f (g x), which is well-known as a function composition operator. This paper investigates an interesting property of B-terms, that is, whether repetitive right applications…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

We prove that certain families of homogenous affine iterated function systems in $\mathbb{R}^d$ have the property that the open set condition and the existence of exact overlaps both occur densely in the space of translation parameters.…

Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can one iterate f? This paper provides estimates on the number of…

In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas…

This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…

There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…