Abstract
The paper continues the first author’s research which shows that automatic reasoning is an effective tool for establishing properties of algebraic constructions associated with knot diagrams. Previous research considered involutory quandles (also known as keis) and quandles. This paper applies automated reasoning to knot semigroups, recently introduced and studied by the second author, and \(\pi \)-orbifold groups of knots. We test two conjectures concerning knot semigroups (specifically, conjectures aiming to describe knot semigroups of diagrams of the trivial knot and knot semigroups of 4-plat knot diagrams) on a large number of examples. These experiments enable us to formulate one new conjecture. We discuss applications of our results to a classical problem of the knot theory, determining whether a knot diagram represents the trivial knot.
Alexei Lisitsa—Part of this research was carried out during visits by the first named author to the Department of Mathematical Sciences at the University of Essex in 2016. The visits were financed by a London Mathematical Society Scheme 7 Grant (ref. SC7-1516-12). This research has been supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No. H2020-FETOPEN-2015-CSA 712689 (SC \(^2\)).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We have chosen Prover9 and model builder Mace4 (below), primarily to be able to compare efficiency of automated reasoning with semigroups with that for involutory quandles in [6], where the same systems were used. Otherwise the choice is not very essential and any other automated first order (dis)provers could be used instead.
- 2.
Fatal Error: mace4: domain_element too big.
- 3.
The described procedure is a version of so-called Fox coloring [17]. Note that in general, labels of some distinct arcs may coincide.
- 4.
We are grateful to José Montesinos (Universidad Complutense de Madrid), Genevieve Walsh (Tufts University) and Vanni Noferini (University of Essex) for attracting our attention to this result.
- 5.
Note that here we mean the usual semigroup deduction, not a more complicated one used in cancellative semigroups. It is useful to remind oneself of this, because knot semigroups are defined using a cancellative presentation, and it makes proving equalities of words in knot semigroups more involved.
- 6.
References
Birkhoff, G.: On the structure of abstract algebras. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 31, pp. 433–454. Cambridge University Press (1935)
Boileau, M., Zimmermann, B.: The \(\pi \)-orbifold group of a link. Mathematische Zeitschrift 200(2), 187–208 (1989)
Burde, G., Heusener, M., Zieschang, H.: Knots. De Gruyter, Berlin (2013)
Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building, vol. 31. Springer, Dordrecht (2013). https://doi.org/10.1007/978-1-4020-2653-9
Elhamdadi, M., Nelson, S.: Quandles, vol. 74. American Mathematical Society, Providence (2015)
Fish, A., Lisitsa, A.: Detecting unknots via equational reasoning, I: exploration. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 76–91. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08434-3_7
Fish, A., Lisitsa, A., Stanovský, D.: A combinatorial approach to knot recognition. In: Horne, R. (ed.) EGC 2015. CCIS, vol. 514, pp. 64–78. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25043-4_7
Fox, R.: A quick trip through knot theory. In: Fort, M.K. (ed.) Topology of Three-Manifolds. Prentice-Hall, Englewood Cliffs (1962)
Gilbert, N.D., Porter, T.: Knots and Surfaces. Oxford University Press, New York (1994)
Huet, G., Oppen, D.C.: Equations and rewrite rules. In: Book, R.N. (ed.) Formal Language Theory: Perspectives and Open Problems, pp. 349–405. Academic Press, New York (1980)
Joyce, D.: A classifying invariant of knots, the knot quandle. J. Pure Appl. Algebra 23(1), 37–65 (1982)
Kauffman, L.H., Henrich, A.: Unknotting unknots. https://arxiv.org/abs/1006.4176
Kauffman, L.H., Lambropoulou, S.: Hard unknots and collapsing tangles. https://arxiv.org/abs/math/0601525v5
Kawauchi, A.: A Survey of Knot Theory. Birkhäuser, Basel (1996)
Lackenby, M.: Upper bound on Reidemeister moves. Ann. Math. 182, 1–74 (2015)
Raymond-Lickorish, W.B.: An Introduction to Knot Theory, vol. 175. Springer, New York (1997). https://doi.org/10.1007/978-1-4612-0691-0
Livingston, C.: Knot Theory, vol. 24. Cambridge University Press, Cambridge (1993)
Manturov, V.: Knot Theory. CRC Press, Boca Raton (2004)
McCune, W.: Prover9 and Mace4 (2005–2010). http://www.cs.unm.edu/mccune/prover9/
Morgan, J.W., Bass, H. (eds.): The Smith Conjecture. Elsevier, Amsterdam (1984)
Murasugi, K.: Knot Theory and Its Applications. Springer, Boston (1996). https://doi.org/10.1007/978-0-8176-4719-3_15
Ochiai, M.: Non-trivial projections of the trivial knot. http://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/99940
O’Hara, J.: Energy of knots and infinitesimal cross ratio. Geom. Topol. Monogr. 13, 421–445 (2008)
Vernitski, A.: Describing semigroups with defining relations of the form xy = yz and yx = zy and connections with knot theory. Semigroup Forum 95(1), 66–82 (2017)
Winker, S.K.: Quandles, knot invariants, and the n-fold branched cover. Ph.D. thesis, University of Illinois at Chicago (1984)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Lisitsa, A., Vernitski, A. (2017). Automated Reasoning for Knot Semigroups and \(\pi \)-orbifold Groups of Knots. In: Blömer, J., Kotsireas, I., Kutsia, T., Simos, D. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2017. Lecture Notes in Computer Science(), vol 10693. Springer, Cham. https://doi.org/10.1007/978-3-319-72453-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-72453-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72452-2
Online ISBN: 978-3-319-72453-9
eBook Packages: Computer ScienceComputer Science (R0)