The Enumeration of Alternating Pretzel Links
Charlotte Aspinwall, Tobias Clark, Yuanan Diao
TL;DR
This work delivers a complete enumeration framework for oriented alternating pretzel links by crossing number, partitioning the class into three standard Types and reducing counting to equivalence classes of t-codes under flypes and diagram symmetries. It leverages Polya enumeration with cycle indices of $C_k$ and $D_k$ to derive closed formulas for $\mathcal{P}_1(c)$, $\mathcal{P}_2(c)$, and $\mathcal{P}_3(c)$, and combines them into the total $\mathcal{P}(c)=2(\mathcal{P}_1(c)+\mathcal{P}_2(c)+\mathcal{P}_3(c))$. The key contributions include the necklace-based $N(n,k)$ counts, the dihedral corrections $B(n,k)$, and the two-color bracelet counts $B(n_1,k_1;n_2,k_2)$ with parity refinements for Type-3, all yielding explicit summations over feasible parameter sets. Numerical results up to $c=50$ reveal exponential growth with rate $e^{0.588c}$ and indicate that Type-3 links dominate at large crossing numbers; this work also notes potential extensions to non-alternating pretzel links and braid-index considerations. The methodology provides a solid combinatorial framework for broader tabulations within Montesinos-related link families.
Abstract
In this paper, we tabulate the set of alternating pretzel links. Specifically, for any given crossing number $c$, we derive a closed formula that would allow us to compute $\mathcal{P}(c)$, the total number of alternating pretzel links with crossing number $c$. Numerical computation suggests that $\mathcal{P}(c)\approx 0.155e^{0.588c}$. That is, the number of alternating pretzel links with a given crossing number $c$ grows exponentially in terms of $c$.
