Classification of k-tangle projections using cascade representation
Abstract
The paper addresses the k-tangle enumeration problem. We introduce a notion of cascade diagram for k-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating k-tangles with 5 crossing or less.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.