The Hausdorff and box-counting dimensions of a class of recurrent sets

Meifeng Dai and Xi Liu

Chaos, Solitons & Fractals, 2008, vol. 36, issue 3, 532-538

Abstract: It is well known that a lot of familiar fractal sets can be generated using recurrent method. Conclusions under similitude linear map are straightforward. In this paper, we study the upper and low bounds for the Hausdorff dimension and boxing-counting dimension of recurrent sets. Especially, we focus our attention on the case of the non-similitude.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077906006837
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:36:y:2008:i:3:p:532-538

DOI: 10.1016/j.chaos.2006.06.083

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().