SearcharxivSearch

arXiv · 2609.24860

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)=\frac{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 $\frac{15}{4π^2}$ and a trefoil probability of $\frac{1}{16π^2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Geisz, Chris Peterson, Clayton Shonkwiler. 2026-09-21. Trefoil Probabilities and Polyhedra. https://arxiv.org/abs/2609.24860

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT