相关论文: A Midsummer Knot's Dream

This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…

The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…

To study embeddings of tangles in knots, we use quandle cocycle invariants. Computations are carried out for the tables of knots and tangles, to investigate which tangles may or may not embed in knots in the tables.

In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…

A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…

We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…

Two losing gambling games, when alternated in a periodic or random fashion, can produce a winning game. This paradox has been inspired by certain physical systems capable of rectifying fluctuations: the so-called Brownian ratchets. In this…

We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy…

Modern Yo-Yo play has developed into a sophisticated international subculture, featuring elite competition and intricate tricks. Despite this, no systematic knot-theoretic treatment has yet been applied to the numerous string configurations…

We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…

We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…

We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.

Parrondo's paradox is about a paradoxical game and gambling where two probabilistic losing games can be combined to form a winning game. While the counter intuitive game is interesting in itself, it can be thought of a discrete version of…

We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.

This paper is an introduction to the theory of virtual knots and links and it gives a list of unsolved problems in this subject.

This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing…

Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these games. In this introduction we develop the fundamentals of…

In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…

The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became…

We study the discrete Voronoi game, where two players alternately claim vertices of a graph for t rounds. In the end, the remaining vertices are divided such that each player receives the vertices that are closer to his or her claimed…