Bridge decompositions with distances at least two

TL;DR

This paper introduces a practical method for n-bridge decompositions of links in three-dimensional space to guarantee that the Hempel distance is at least two, aiding in the analysis of link complexity.

Contribution

It provides a new technique to ensure a minimum Hempel distance in bridge decompositions, improving the understanding of link structures.

Findings

Method guarantees Hempel distance ≥ 2 in bridge decompositions

Enhances analysis of link complexity in 3D space

Applicable to various link types

Abstract

For n-bridge decompositions of links in S^3, we propose a practical method to ensure that the Hempel distance is at least two.