Related papers: A Midsummer Knot's Dream

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings.…

We study the behavior of Legendrian and transverse knots under the operation of connected sums. As a consequence we show that there exist Legendrian knots that are not distinguished by any known invariant. Moreover, we classify Legendrian…

I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.

Lights Out! is a game played on a $5 \times 5$ grid of lights, or more generally on a graph. Pressing lights on the grid allows the player to turn off neighboring lights. The goal of the game is to start with a given initial configuration…

We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…

This is a PhD thesis about low dimensional topology, in particular knot thory in 3-manifolds also different from the 3-sphere, topological applications of quantum invariants, and Turaev's shadows. There is an introduction and a survey for…

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences…

We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…

We study games in which every action requires planning and preparation. Moreover, before players act, they can revise their plans based on partially revealing information that they receive on their adversary's preparations. In turn, we…

We model the Lights Out game on general simple graphs in the framework of linear algebra over the field $\mathbb F_2$. Based upon a version of the Fredholm alternative, we introduce a separating invariant of the game, i.e., an initial state…

We look into computational aspects of two classical knot invariants. We look for ways of simplifying the computation of the coloring invariant and of the Alexander module. We support our ideas with explicit computations on pretzel knots.

We say that a knot $k_1$ in the $3$-sphere {\it $1$-dominates} another $k_2$ if there is a proper degree 1 map $E(k_1) \to E(k_2)$ between their exteriors, and write $k_1 \ge k_2$. When $k_1 \ge k_2$ but $k_1 \ne k_2$ we write $k_1 > k_2$.…

This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have…

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

We discuss four famous card games that can help learn linear algebra. The games are: SET, Socks, Spot it!, and EvenQuads. We describe the game in the language of vector, affine, and projective spaces. We also show how these games are…

On the blockchain, NFT games have risen in popularity, spawning new types of digital assets. We present a simplified version of well-known NFT games, followed by a discussion of issues influencing the structure and stability of generic…

In this work, we propose two optical setups for two-players, non-zero and zero sum, quantum games in optical networks using light polarization of single-photon pulses, single-photon detectors and linear optical devices. The optical setups…

We introduce a new invariant for a $2$-knot in $S^4$, called the shadow-complexity, based on the theory of Turaev shadows, and we give a characterization of $2$-knots with shadow-complexity at most $1$. Specifically, we show that the unknot…