Please use this identifier to cite or link to this item:
https://doi.org/10.1007/BF02432003
| Title: | The polynomial topological complexity of Fatou-Julia sets | Authors: | Chong, C.T. | Issue Date: | May-1995 | Citation: | Chong, C.T. (1995-05). The polynomial topological complexity of Fatou-Julia sets. Advances in Computational Mathematics 3 (4) : 369-374. ScholarBank@NUS Repository. https://doi.org/10.1007/BF02432003 | Abstract: | We analyze the polynomial topological complexity of Fatou-Julia sets, and show that for Sullivan domains of such sets the complexity is equal to 1 in the case of attracting, superattracting and Siegel domains, while for parabolic domains it is greater than 1. © 1995 J.C. Baltzer AG, Science Publishers. | Source Title: | Advances in Computational Mathematics | URI: | http://scholarbank.nus.edu.sg/handle/10635/114406 | ISSN: | 10197168 | DOI: | 10.1007/BF02432003 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.