Open Access
2019 The linking-unlinking game
Adam Giambrone, Jake Murphy
Involve 12(7): 1109-1141 (2019). DOI: 10.2140/involve.2019.12.1109

Abstract

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the knotting-unknotting game and the region unknotting game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the game. In this paper, we introduce the linking-unlinking game which is played on two-component link shadows. We then present winning strategies for the linking-unlinking game played on all shadows of two-component rational tangle closures and played on a large family of general two-component link shadows.

Citation

Download Citation

Adam Giambrone. Jake Murphy. "The linking-unlinking game." Involve 12 (7) 1109 - 1141, 2019. https://doi.org/10.2140/involve.2019.12.1109

Information

Received: 30 July 2018; Revised: 17 May 2019; Accepted: 11 June 2019; Published: 2019
First available in Project Euclid: 26 October 2019

zbMATH: 07140468
MathSciNet: MR4023341
Digital Object Identifier: 10.2140/involve.2019.12.1109

Subjects:
Primary: 57M25 , 91A46

Keywords: knot , knot diagram , link , link diagram , linking-unlinking game , pseudodiagram , rational link , rational tangle , splittable , two-player game , unsplittable , winning strategy

Rights: Copyright © 2019 Mathematical Sciences Publishers

Vol.12 • No. 7 • 2019
MSP
Back to Top