Related papers: Epsilon-Distortion Complexity for Cantor Sets
We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…
We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
Consider $d$ disjoint closed subintervals of the unit interval and consider an orientation preserving expanding map which maps each of these subintervals to the whole unit interval. The set of points where all iterates of this expanding map…
In this article, an iterated function system (IFS) is considered on the real projective line $\mathbb{RP}^1$ so that the attractor is a Cantor-like set. Hausdorff dimension of this attractor is estimated. The existence of a probability…
We consider (not self-similar) Cantor sets defined by a sequence of piecewise linear functions. We prove that the dimension of the harmonic measure on such a set is strictly smaller than its Hausdorff dimension. Some Hausdorff measure…
Direct evaluation of the rate-distortion function has rarely been achieved when it is strictly greater than its Shannon lower bound. In this paper, we consider the rate-distortion function for the distortion measure defined by an…
A formal definition of epsilon-complexity of an individual continuous function defined on a unit cube is proposed. This definition is consistent with the Kolmogorov's idea of the complexity of an object. A definition of epsilon-complexity…
The notion of complex dimension of a one-dimensional Cantor set $C=\bigcap_{n=1}^\infty C_n$ dates back decades. It is defined as the set of poles of the meromorphic $\zeta$-function $\zeta(s)=\sum_{n=1}^{\infty}d_j^s$, where $\Re s>0$, and…
In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…
Consider the dynamical system constitued by a continuous function $F:\mathcal{A}^\mathbb{N}\to\mathcal{A}^\mathbb{N}$ where $\mathcal{A}$ is a finite alphabet. The perturbed counterpart, denoted by $F_\epsilon$, is obtained after each…
We describe a numerical procedure to compute the so-called isospectral torus of finite gap sets, that is, the set of Jacobi matrices whose essential spectrum is composed of finitely many intervals. We also study numerically the convergence…
We consider the problem of coding for computing with maximal distortion, where the sender communicates with a receiver, which has its own private data and wants to compute a function of their combined data with some fidelity constraint…
Let $C$ be the attractor of the IFS $\{f_{d}(z) = (-n+i)^{-1}(z+d): d\in D\}$, $D\subset\{0, 1, \ldots, n^{2}\}$ and let $\dim$ denote the box-counting dimension. It is known that for all $\lambda\in[0, 1]$, that the set of complex numbers…
In this article, we consider the concept of the decay of the Favard length of $\varepsilon$-neighborhoods of purely unrectifiable sets. We construct non-self-similar Cantor sets for which the Favard length decays arbitrarily with respect to…
We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…
Let $E, F\subset \R^d$ be two self-similar sets. Under mild conditions, we show that $F$ can be $C^1$-embedded into $E$ if and only if it can be affinely embedded into $E$; furthermore if $F$ can not be affinely embedded into $E$, then the…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
Computational mechanics, an approach to structural complexity, defines a process's causal states and gives a procedure for finding them. We show that the causal-state representation--an $\epsilon$-machine--is the minimal one consistent with…
In this article we study Cantor sets defined by monotone sequences, in the sense of Besicovitch and Taylor. We classify these Cantor sets in terms of their h-Hausdorff and h-Packing measures, for the family of dimension functions h, and…