arXiv Analytics

Sign in

arXiv:math/9903054 [math.DS]AbstractReferencesReviewsResources

Solving the quintic by iteration in three dimensions

Scott Crass

Published 1999-03-09, updated 1999-10-06Version 2

The requirement for solving a polynomial is a means of breaking its symmetry, which in the case of the quintic, is that of the symmetric group S_5. Induced by its five-dimensional linear permutation representation is a three-dimensional projective action. A mapping of complex projective 3-space with this S_5 symmetry can provide the requisite symmetry-breaking tool. The article describes some of the S_5 geometry in CP^3 as well as several maps with particularly elegant geometric and dynamical properties. Using a rational map in degree six, it culminates with an explicit algorithm for solving a general quintic. In contrast to the Doyle-McMullen procedure - three 1-dimensional iterations, the present solution employs one 3-dimensional iteration.

Related articles: Most relevant | Search more
arXiv:1308.6648 [math.DS] (Published 2013-08-30)
Fractal Transformations in 2 and 3 Dimensions
arXiv:2003.01528 [math.DS] (Published 2020-03-01)
Solving the octic by iteration in six dimensions
arXiv:1512.05308 [math.DS] (Published 2015-12-16)
Confining classical particles with magnetic fields in 2 dimensions