An n-braid is called k-decomposable if and only if the removal of k arbitrary strands results in a trivial (n - k)-braid. k-decomposable n-linkages are similarly defined. All k-decomposable n-braids ...
This is a preview. Log in through your library . Abstract Let $V_i$ be a finite dimensional vector space over a field $F$ for each $i = 1, 2, \ldots, m$, and let $z ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results