1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF02432003
DC FieldValue
dc.titleThe polynomial topological complexity of Fatou-Julia sets
dc.contributor.authorChong, C.T.
dc.date.accessioned2014-12-02T06:53:31Z
dc.date.available2014-12-02T06:53:31Z
dc.date.issued1995-05
dc.identifier.citationChong, C.T. (1995-05). The polynomial topological complexity of Fatou-Julia sets. Advances in Computational Mathematics 3 (4) : 369-374. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/BF02432003" target="_blank">https://doi.org/10.1007/BF02432003</a>
dc.identifier.issn10197168
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/114406
dc.description.abstractWe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/BF02432003
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/BF02432003
dc.description.sourcetitleAdvances in Computational Mathematics
dc.description.volume3
dc.description.issue4
dc.description.page369-374
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.