The Morley hexagon, planar recursion, and the MOLEY 3D chain
A regular hexagon splits into six equilateral triangles. The incenters of their Morley triangles form a smaller regular hexagon, and the side length is multiplied by 1/sqrt(3) at each step. The intersection of the nested hexagons is the center. On the regular tetrahedron, the first steps of the three-dimensional chain satisfy a(k+1) = r(k) a(k). The planar recursion keeps the hexagon and contracts to a point. The three-dimensional chain changes the number of edges, from 6 to 12 to 30, and regularity breaks. This record contains the English PDF, the Portuguese PDF, and a supplementary zip with the LaTeX sources and figures. It is paper 2 of 3. It uses the junction rules and the scale r(n) of paper 1. The identity a(k+1) = r(k) a(k) is checked on the first two steps of the tetrahedron chain at n = 3.
Authors
- Fábio Dayan Soares de Melo (ORCID: https://orcid.org/0009-0006-6475-0187)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24247161
- Primary Topic
- Mathematics and Applications
- Type
- preprint