Alec Kriebel

A parity-selected endpoint theorem for the regular dodecahedron

Read the paper (PDF) · Download PDF · Supporting ZIP · Zenodo record

Plain-English explanation · Read on this page · Collaboration


Abstract

We distinguish two formulations associated with Fuchs's short-geodesic question on the regular dodecahedron. The bare endpoint-angle condition admits two direct face-diagonal counterexamples at each initial face and vertex. With an explicit parity-selected convention, an unbounded endpoint-exclusion theorem follows from a double-pentagon germ calculation and the classical midpoint half-turn mechanism: the endpoints cannot have graph distance two. The convention is an adopted disambiguation, not an authenticated author correction. We credit the earlier symmetry arguments and a contemporaneous overlapping preprint, record the available chronology, and claim no historical firstness. Exact supporting checks also separate a valid public face path from errors in its angle and displayed-coordinate certificates.

The idea in plain English

Unfolding the faces makes a path across a dodecahedron into a straight line until it reaches its first new vertex. Two direct diagonals show that a simpler endpoint-angle rule picks out extra paths. The parity of the number of face pieces distinguishes the intended class.

The precise result

Under the stated parity-selected convention, the endpoints of a short geodesic of type A₀ on the regular dodecahedron cannot have distance two in the edge graph. Under the bare angle condition, exactly two direct face diagonals from each starting face and vertex are exceptions to this exclusion.

Why the midpoint matters

The odd case reduces to the immediate edge directions. In the even case the developed endpoint germ identifies a midpoint half-turn of the dodecahedron that exchanges the endpoint vertices. Vertices at graph distance two would force that half-turn to fix their unique common neighbor, which its vertex stabilizer precludes.

Scope

A short geodesic ends at its first vertex, with no bound on the number of crossed faces. The convention is an adopted reading of the angle and parity definitions. The note distinguishes a valid public face itinerary from separate errors in its angle and coordinate certificates.

Background and prior work

The question comes from Fuchs. The proof uses the midpoint symmetry mechanism of Athreya, Aulicino and Hooper. It credits the related Platonic-solid geometry of Troubetzkoy and the same endpoint result in Ferudun’s preprint.

Status and AI use

Unrefereed preprint. AI tools assisted substantially in developing, writing and checking the work. Independent human review is welcome.

Read the paper

Open the published PDF · Download PDF · Original PDF on Zenodo

Supporting materials

Download verification-package.zip · Original verification-package.zip on Zenodo

Download dodecahedron_endpoint.tex · Original dodecahedron_endpoint.tex on Zenodo

Collaborate on this result

I welcome independent checks of the endpoint germ transport or alternative expositions of the midpoint symmetry argument.

Authorship and responsibilities would be discussed in relation to substantive contributions. Contact Alec.

Cite this paper

Kriebel, Alec (2026). A parity-selected endpoint theorem for the regular dodecahedron. Version 1.0. Zenodo. 10.5281/zenodo.23384007.

Download BibTeX

Licensing

The deposited work is available under Creative Commons Attribution 4.0.