3 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
Filled Julia sets with empty interior are computable
I. Binder, M. Braverman, M. Yampolsky
We show that if a polynomial filled Julia set has empty interior, then it is computable.
Non-computable Julia sets
Mark Braverman, Michael Yampolsky
We show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.
Mating Siegel Quadratic Polynomials
Michael Yampolsky, Saeed Zakeri
Let F be a quadratic rational map of the sphere which has two fixed Siegel disks with bounded type rotation numbers theta and nu. Using a new degree 3 Blaschke product model for th…
The Attractor of Renormalization and Rigidity of Towers of Critical Circle Maps
Michael Yampolsky
We demonstrate the existence of a global attractor A with a Cantor set structure for the renormalization of critical circle mappings. The set A is invariant under a generalized ren…