pith. sign in

arxiv: 0712.3859 · v2 · submitted 2007-12-22 · 🧮 math.GT

Classification of k-tangle projections using cascade representation

classification 🧮 math.GT
keywords projectionscascadetangleenumerationrepresentationtanglesaddressesalgorithm
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.