The Farthest Point Map on the Regular Dodecahedron
Abstract
Let be the regular dodecahedron, equipped with its intrinsic path metric. Given let where is the point on which maximizes the distance to . (Generically, is single-valued.) We give a complete description of the map and as a consequence show that the -limit set of is the -skeleton of a subdivision of into convex quadrilaterals. is a piecewise bi-quadratic map, and each algebraic piece is defined by a straight line construction involving a rhombus. The rhombi involved have the same shapes as the ones in the Penrose tiling. Our proof is computer-assisted but rigorous.
Keywords
Cite
@article{arxiv.2104.02567,
title = {The Farthest Point Map on the Regular Dodecahedron},
author = {Richard Evan Schwartz},
journal= {arXiv preprint arXiv:2104.02567},
year = {2021}
}
Comments
64 pages, computer assisted proof. I am disappointed at the length and complexity of the proof, and I don't know if I will try to publish this paper and thereby inflict it on a referee. However, I think it is worth having this result, and some proof, on the record