Abstract: The paper addresses the enumeration problem for k-tangles. We introduce the notion of a cascade diagram of a k-tangle projection and suggest an effective enumeration algorithm for projections based on the cascade representation. Tangle projections and alternating tangles with up to 12 crossings are tabulated. We also provide pictures of alternating k-tangles with at most five crossings.
Publication Year: 2011
Publication Date: 2011-12-11
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot