Classification of k-tangle projections using cascade representation

MaRDI QIDQ6207918FDO

Authors Andrey Bogdanov, Vadim Meshkov, Alexander V. Omelchenko, Michael Petrov

Publication date 22 December 2007

Has companion code repository https://github.com/mishun/tangles

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 page was built for publication: Classification of $k$-tangle projections using cascade representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207918)