We define a notion of complexity for labeled oriented trees (LOTs) related to the bridge number in knot theory and prove that LOTs of complexity 2 are aspherical. We also present a class of LOTs of higher complexity which is aspherical, give an upper bound for the complexity of labeled oriented intervals and study the complexity of torus knots.
Proceedings – Mathematical Sciences
Volume 133, 2023 All articles Continuous Article Publishing mode
