Displaying similar documents to “The dimension of graph directed attractors with overlaps on the line, with an application to a problem in fractal image recognition”

Spaces of ω-limit sets of graph maps

Jie-Hua Mai, Song Shao (2007)

Fundamenta Mathematicae

Similarity:

Let (X,f) be a dynamical system. In general the set of all ω-limit sets of f is not closed in the hyperspace of closed subsets of X. In this paper we study the case when X is a graph, and show that the family of ω-limit sets of a graph map is closed with respect to the Hausdorff metric.

On univoque points for self-similar sets

Simon Baker, Karma Dajani, Kan Jiang (2015)

Fundamenta Mathematicae

Similarity:

Let K ⊆ ℝ be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides...

Infinite Graph-Directed Systems and Hausdorff Dimension

Amit Priyadarshi (2017)

Waves, Wavelets and Fractals

Similarity:

In this paper we study infinite graph-directed iterated function systems on compact metric spaces given by contractive ‘infinitesimal similitudes’. We derive formula for the Hausdorff dimension of the ‘invariant set’ for such a system in terms of the spectral radii of the naturally associated family of the ‘Perron- Frobenius operators’. The results in this paper generalizes the results obtained in [20], where finite graphdirected systems and infinite iterated function systems are considered ...

Using DNA Self-assembly Design Strategies to Motivate Graph Theory Concepts

J. Ellis-Monaghan, G. Pangborn (2011)

Mathematical Modelling of Natural Phenomena

Similarity:

A number of exciting new laboratory techniques have been developed using the Watson-Crick complementarity properties of DNA strands to achieve the self-assembly of graphical complexes. For all of these methods, an essential step in building the self-assembling nanostructure is designing the component molecular building blocks. These design strategy problems fall naturally into the realm of graph theory. We describe graph theoretical formalism for various construction methods, and then...