CONSTRUCTING ALGEBRAIC LINKS FOR LOW EDGE NUMBERS
Abstract
A method is given for economically constructing any algebraic knot or link K. This construction, which involves tree diagrams, gives a new upper bound for the edge number of K that is proven to be at most twice the crossing number of K. Furthermore, it realizes a minimal-crossing projection.