activity
19922020
most citedPolynomial root-finding algorithms and branched covers

21 citations · 37 across the 7 of their papers we have counts for

collaborators
Showing math.DSShow all

7 papers · 1 filter

math.DS2020★ 3 cited

The W. Thurston Algorithm for Real Quadratic Rational Maps

Araceli Bonifant, John Milnor, Scott Sutherland

A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of…

math.DS2020

The W. Thurston Algorithm Applied to Real Polynomial Maps

Araceli Bonifant, John Milnor, Scott Sutherland

This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.

math.DS2017★ 5 cited

On the Lebesgue measure of the Feigenbaum Julia set

Artem Dudko, Scott Sutherland

We show that the Julia set of the Feigenbaum polynomial has Hausdorff dimension less than~2 (and consequently it has zero Lebesgue measure). This solves a long-standing open questi…

math.DS1995

Further travels with my ant

David Gale, James Propp, Scott Sutherland +1

We discuss some properties of a class of cellular automata sometimes called a "generalized ant". This system is perhaps most easily understood by thinking of an ant which moves abo…

math.DS1992★ 4 cited

Problems in holomorphic dynamics

Ben Bielefeld, Mikhail Lyubich, Lennart Carleson +7

Contents: 1. Quasiconformal Surgery and Deformations: Ben Bielefeld, Questions in quasiconformal surgery; Curt McMullen, Rational maps and Teichmüller space; John Milnor, Thurston'…

math.DS1992★ 2 cited

Dynamics of certain non-conformal degree two maps on the plane

Ben Bielefeld, Scott Sutherland, Folkert Tangerman +1

In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for fixed, maps …

math.DS1992★ 21 cited

Polynomial root-finding algorithms and branched covers

Myong-Hi Kim, Scott Sutherland

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree with a path-lifting algorithm for finding individual ro…