The Enumeration of Alternating Pretzel Links
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 P(c), the total number of alternating pretzel links with crossing number c. Numerical computation suggests that P(c)≈ 0.155e0.588c. That is, the number of alternating pretzel links with a given crossing number c grows exponentially in terms of c.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.