Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 58 min ago
PreprintCC0arXiv

Trefoil Probabilities and Polyhedra

Abstract

We determine the exact probability that the closed hexagonal polygon obtained by cyclically joining six independent points uniformly distributed on the unit sphere is knotted. The only possible nontrivial knot is a trefoil. Almost surely, the convex hull of the six points has one of two simplicial combinatorial types: a combinatorially regular octahedron and a combinatorially non-regular octahedron. We show that the straight-line complete graph on the six vertices of the hull of the combinatorially regular octahedral type admits exactly one unoriented trefoil Hamiltonian cycle. On the other hand, no cycle connecting vertices of the irregular octahedron can produce a trefoil. We then use stereographic projection to transform the probability of the regular hull type to a Sylvester-type problem for the planar beta-prime probability measure dμ(x,y)=(dx dy)/(π (1+x2+y2)2). Applying Stokes' theorem and the Blaschke-Petkantschin formula, we compute the expected squared μ-content of a random triangle. This yields a regular octahedral probability of 15/4π2 and a trefoil probability of 1/16π2.

Related

  1. A note on right-angled, ideal hyperbolic polyhedra
    Ian Whitehead
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  2. Rational decomposition of polyhedra and a conjecture of Brlek and Reutenauer
    Flavio D'Alessandro, Paolo Papi
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  3. A new family of constant width bodies obtained from Reuleaux polyhedra
    Marcela G. Mercado-Flores, Edgardo Roldán-Pensado
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  4. A short proof of a range-relative FPTAS for polynomial integer optimization over bounded polyhedra
    Robert Hildebrand
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Arithmetic Polyhedra
    Daniel Allcock, Pat Devlin, Anna Felikson +2
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryGeometry & topologyarXiv
BibTeX
@misc{geisz2026trefoil,
  title = {{Trefoil Probabilities and Polyhedra}},
  author = {Joseph Geisz and Chris Peterson and Clayton Shonkwiler},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.24860},
  eprint = {2609.24860},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.24860},
  note = {CC0},
}
RIS
TY  - UNPB
TI  - Trefoil Probabilities and Polyhedra
AU  - Joseph Geisz
AU  - Chris Peterson
AU  - Clayton Shonkwiler
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.24860
UR  - https://arxiv.org/abs/2609.24860
AB  - We determine the exact probability that the closed hexagonal polygon obtained by cyclically joining six independent points uniformly distributed on the unit sphere is knotted. The only possible nontrivial knot is a trefoil. Almost surely, the convex hull of the six points has one of two simplicial combinatorial types: a combinatorially regular octahedron and a combinatorially non-regular octahedron. We show that the straight-line complete graph on the six vertices of the hull of the combinatorially regular octahedral type admits exactly one unoriented trefoil Hamiltonian cycle. On the other hand, no cycle connecting vertices of the irregular octahedron can produce a trefoil. We then use stereographic projection to transform the probability of the regular hull type to a Sylvester-type problem for the planar beta-prime probability measure dμ(x,y)=(dx dy)/(π (1+x^2+y^2)^2). Applying Stokes' theorem and the Blaschke-Petkantschin formula, we compute the expected squared μ-content of a random triangle. This yields a regular octahedral probability of 15/4π^2 and a trefoil probability of 1/16π^2.
ER  -