Related papers: A Midsummer Knot's Dream
We study the properties of glued knots, a sub-class of real rational knots, that can be constructed by gluing ellipses. We define an invariant called the gluing degree and relate it to various classical properties of knots and classify all…
We construct two knot invariants. The first knot invariant is a sum constructed using linking numbers. The second is an invariant of flat knots and is a formal sum of flat knots obtained by smoothing pairs of crossings. This invariant can…
The theory behind the Lights Out game has been developed by several authors. The aim of this work is to present some results related to this game using Linear Algebra. We establish a criterion for the solubility of this game in the case of…
Strategic interactions between a group of individuals or organisations can be modelled as games played on networks, where a player's payoff depends not only on their actions but also on those of their neighbours. Inferring the network…
Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the actions taken by their neighbors. Extending the framework of…
We review recent efforts to machine learn relations between knot invariants. Because these knot invariants have meaning in physics, we explore aspects of Chern-Simons theory and higher dimensional gauge theories. The goal of this work is to…
We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to…
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P_3-game is fascinating. We show that the connected P_3-game…
The paper introduces two player connectivity games played on finite bipartite graphs. Algorithms that solve these connectivity games can be used as subroutines for solving M\"uller games. M\"uller games constitute a well established class…
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…
Cournot dynamical game is studied on a graph. The stability of the system is studied. Prisoner's dilemma game is used to model natural gas transmission.
We give a number theoretic proof of the integrality of certain BPS invariants of knots. The formulas for these numbers are sums involving binomial coefficients and the M\"obius function. We also prove a conjecture about further divisibility…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
Neighborhood Lights Out is a game played on graphs. Begin with a graph and a vertex labeling of the graph from the set $\{0,1,2,\dots, \ell-1\}$ for $\ell \in \mathbb{N}$. The game is played by toggling vertices: when a vertex is toggled,…
The recent popularity of Wordle has revived interest in guessing games. We develop a general method for finding optimal strategies for guessing games while avoiding an exhaustive search. Our main contributions are several theorems that…
We define new invariants of knots by means of quandle colorings and longitudinal information. These invariants can be applied to a tangle embedding problem and recognizing non-classical virtual knots.
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
The game of Moksha-Patam, often known as `Chutes and Ladders', is a widely played indoor game worldwide. While studies have been conducted regarding the nature of an individual board, the possibilities that open up when we change the…