Involve: A Journal of Mathematics

  • Involve
  • Volume 12, Number 7 (2019), 1109-1141.

The linking-unlinking game

Adam Giambrone and Jake Murphy

Full-text: Access denied (no subscription detected)

However, an active subscription may be available with MSP at msp.org/involve.

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
Involve, Volume 12, Number 7 (2019), 1109-1141.

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

Permanent link to this document
https://projecteuclid.org/euclid.involve/1572055223

Digital Object Identifier
doi:10.2140/involve.2019.12.1109

Mathematical Reviews number (MathSciNet)
MR4023341

Zentralblatt MATH identifier
07140468

Subjects
Primary: 57M25: Knots and links in $S^3$ {For higher dimensions, see 57Q45} 91A46: Combinatorial games

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

Citation

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


Export citation

References

  • C. C. Adams, The knot book: an elementary introduction to the mathematical theory of knots, Freeman, New York, 1994.
  • B. Bollobás, Modern graph theory, Graduate Texts in Math. 184, Springer, 1998.
  • S. Brown, F. Cabrera, R. Evans, G. Gibbs, A. Henrich, and J. Kreinbihl, “The region unknotting game”, Math. Mag. 90:5 (2017), 323–337.
  • S. Ganzell, A. Meadows, and J. Ross, “Twist untangle and related knot games”, Integers 14 (2014), art. id. G4.
  • R. Hanaki, “Pseudo diagrams of knots, links and spatial graphs”, Osaka J. Math. 47:3 (2010), 863–883.
  • M. Henle, A combinatorial introduction to topology, Freeman, San Francisco, 1979.
  • A. Henrich, N. MacNaughton, S. Narayan, O. Pechenik, R. Silversmith, and J. Townsend, “A midsummer knot's dream”, College Math. J. 42:2 (2011), 126–134.
  • W. Johnson, “The knotting-unknotting game played on sums of rational shadows”, preprint, 2011.
  • I. Johnson and A. K. Henrich, An interactive introduction to knot theory, Dover, Mineola, NY, 2017.