Decomposable Braids and Linkages
Author:
- H. LevinsonHLH. Levinson
Open Access
- 1 April 1973
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 178, 111-126
Abstract
An n-braid is called k-decomposable if and only if the removal of k arbitrary strands results in a trivial -braid. k-decomposable n-linkages are similarly defined. All k-decomposable n-braids are generated by an explicit geometric process, and so are all k-decomposable n-linkages. The latter are not always closures of k-decomposable n-braids. Many examples are given.Keywords
This publication has 2 references indexed in Scilit:
- Theory of BraidsAnnals of Mathematics, 1947
- A Lemma on Systems of Knotted CurvesProceedings of the National Academy of Sciences, 1923