P. Doyle, C. McMullen.: Solving the quintic by iteration. In preparation.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....define a multiplication in # # and show that under this multiplication# # has an exterior algebra structure. We also show how to extend the results to vector fields, and exhibit a relationship between # invariant forms and logarithmic forms. 1. Introduction In 1989, P. Doyle and C. McMullen [2] solved the fifth degree polynomial with a highly symmetrical dynamical system which preserved the Galois group A 5 . In 1997, S. Crass and P. Doyle [1] solved the sixth degree polynomial by again finding a dynamical system with special symmetry this time A 6 symmetry. Each dynamical system was ....

Doyle, P. and McMullen, C., Solving the quintic by iteration. Acta Math., 163, no.3--4 (1989), 151--180.

....which can be carried out by iterating a single rational function, without allowing any if then branching. In [Mc1] he showed that the roots of a polynomial of degree n can be computed by a generally convergent purely iterative algorithm if and only if n 3. With Peter Doyle [DMc] he showed that these roots can be computed by a tower of nitely many such algorithms if and only if n 5. A Fat Julia Set. The Julia set J of a rational map f from the Riemann sphere b C = C [f1g to itself can be described roughly as the compact set consisting of all points z 2 b C such ....

P. Doyle and C. McMullen, Solving the quintic by iteration, Acta Math. 163 (1989), 151180.

....real algebraic) then there exist generally convergent algorithms for all degrees. 3) One can remain in the complex algebraic category and consider, more generally, finite towers of purely iterative algorithms. In this context polynomials of degree 5 become solvable but those of degree 6 are not [DM]. 4) Although Theorem 1.2 implies 1.1, the techniques we use here do not yield the rigidity result for algebraic families which underlies the proof of Theorem 1.1 in [Mc1] Similarly, the statement of 4 Theorem 1.1 in [Mc1] is formally stronger than that given here: the full measure ....

P. Doyle, C. McMullen.: Solving the quintic by iteration. In preparation.

No context found.

P. Doyle and C. McMullen. Solving the quintic by iteration. Acta Math. 163(1989), 151-180.

....una ected, and called semi invariant when they are almost una ected they change by a constant. Semi invariants are the subject of this thesis. 1 2 1.2 Mathematician s The present inquiry on semi invariants arose from some questions about dynamical systems. In 1989, P. Doyle and C. McMullen [5] solved the fth degree polynomial using a highly symmetrical dynamical system which preserved the Galois group A 5 . In 1997, S. Crass and P. Doyle [4] tackled the sixth degree polynomial by again nding a dynamical system with special symmetry this time A 6 symmetry. Each dynamical system was ....

Doyle, P., and McMullen, C. Solving the quintic by iteration. Acta Math. 163, no. 3-4 (1989), 151-180.

No context found.

P. Doyle and C. McMullen. Solving the quintic by iteration. Acta Math. 163(1989), 151--180.

....is the thin set of indecisive points, forming the boundary between regions converging to one point of A or to another. This rational map is especially symmetric: it commutes with the symmetries of the dodecahedron, and it can be used to solve the quintic equation. But that is another story; see [DMc]) We can now state one of the central open problems in the field. Conjecture HD. Hyperbolic maps are open and dense among all rational maps. It is easy to see that hyperbolicity is an open condition; but the density of hyperbolic dynamics has so far eluded proof. Given recent events in number ....

P. Doyle and C. McMullen. Solving the quintic by iteration. Acta Math. 163(1989), 151--180.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC