Search Results

Given an hyperbolic IFS $(X,\{f_i:i=1,\ldots,N\})$ and denoting its code space by $\Sigma_N = \{1,\ldots,N\}^{\mathbb{N}}$ and the generated fractal set by $\mathcal{A}$. There is a continuous and su …

Let $M \subseteq \mathbb{R}^n$ be bounded and $N_{\epsilon}(M)$ the minimum number of 'squares' of side $\epsilon$ with center in M necessary to cover $M$. The box dimension of M is then defined as $\ …

This Hausdorff dimension of the graph of an increasing function shows that: Let $f$ be a continuous, strictly increasing function from $[0,1]$ to itself with $f(0)=0, f(1)=1$. Then $dim_H \; G …

I want to justify why the Chaos game works to produce Sierpinski triangle. I use a theorem taken from Massopust Interpolation and Approximation with Splines and Fractals. Suppose that $(X,d)$ is a co …

Let $f:[0,1] \to \mathbb{R}, G = graph(f)$. If $\sum_{j = 1}^m |f(x_i)-f(x_{i-1})|^s \le c$ for all partitions $0 = x_0< \ldots < x_m = 1 $ then $H^s(G) < \infty$ What technique can I use to prove t …

The following is a small correction to Massopust Interpolation and Approximation with Splines and Fractals. Relation between the fractal generated by the IFS $A$ and the invariant measure $m$ If the …

Let me encode the solution of the problem explicitly. From the linked answer we had: Theorem If $\gamma:[a,b]\to (X,d)$ is an injective rectifiable curve and $\Gamma=f([a,b])$, then $$\mathcal{H} …