arXiv · math/0408255
We prove that there is an algorithm to decide whehter two virtual links are equivalent or not
Explore connections, maps & timelines
Vassily Olegovich Manturov. 2004-08-19. Virtual links are algorithmically recognisable. https://arxiv.org/abs/math/0408255
Cite the original work for its findings. Save a collection to share your selection of sources.
KEEP EXPLORING
In this paper we use ideas introduced earlier by Moody, Long, Long-Paton, and Bigelow to prove the theorem of the title, that the Burau representation of the classical braid group is faithful for n = 4. An immediate corollary is that the Jones representation of the braid group is also faithful for n = 4.
We exhibit an annular knot with wrapping number four whose Kauffman bracket has annular degree at most two. This disproves the wrapping number conjecture.
A result of Futer, Kalfagianni, and Purcell implies that an upper volume bound for all link complements in the 3-sphere cannot depend solely on the braid index. In this paper, we introduce the Lorenz braid index and generalise the bunch algorithm to provide a general upper volume bound for all link complements in the 3-sphere. Such an upper bound is a quadratic polynomial in the Lorenz braid index. In addition, we construct an explicit family of hyperbolic Lorenz knots for which the classical braid index and the Seifert genus both tend to infinity, while the Lorenz braid index remains bounded.