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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
