Upper bounds for the complexity of some pretzel knots complements
Authors
Vladimir Viktorovich Tarkaev
Chelyabinsk State University and Institute of Mathematics and Mechanics, Ural Brunch of the Russian Academy of Sciences, Ekaterinburg
Evgeny Anatol’evich Fominykh
Chelyabinsk State University and Institute of Mathematics and Mechanics, Ural Brunch of the Russian Academy of Sciences, Ekaterinburg
Keywords:
pretzel knot, complexity
Abstract
Exact values and upper bounds for the complexity of some 3-strand pretzel knot complements are established.
Author Biographies
Vladimir Viktorovich Tarkaev, Chelyabinsk State University and Institute of Mathematics and Mechanics, Ural Brunch of the Russian Academy of Sciences, Ekaterinburg
Research Fellow
Evgeny Anatol’evich Fominykh, Chelyabinsk State University and Institute of Mathematics and Mechanics, Ural Brunch of the Russian Academy of Sciences, Ekaterinburg
