Hanoi attractors and the Sierpiński gasket
by Patricia Alonso-Ruiz; Uta R. Freiberg
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 3, No. 4, 2012

Abstract: The famous game Towers of Hanoi is related with a family of so-called Hanoi-graphs. We regard these non-self-similar graphs as geometrical objects and obtain a sequence of fractals (HGa)a converging to the Sierpinski gasket which is one of the best studied fractals. It is shown that this convergence holds not only with respect to the Hausdorff distance, but that also Hausdorff dimension does converge. Moreover, it is shown that each of the approximating sets has non-trivial Hausdorff measure.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com