Related papers: On 3-terminal positions in Hex

Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…

In this series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…

Hex is a complex game with a high branching factor. For the first time Hex is being attempted to be solved without the use of game tree structures and associated methods of pruning. We also are abstaining from any heuristic information…

In this paper, we give an algorithm to build all compact orientable atoroidal Haken 3-manifolds with tori boundary or closed orientable Haken 3-manifolds, so that in both cases, there are embedded closed orientable separating incompressible…

Given a (genus 2) cube-with-holes M, i.e. the complement in S^3 of a handlebody H, we relate intrinsic properties of M (like its cut number) with extrinsic features depending on the way the handlebody H is knotted in S^3. Starting from a…

We use our new type of bounded locally homeomorphic quasiregular mappings in the unit 3-ball to address long standing problems for such mappings. The construction of such mappings comes from our construction of non-trivial compact…

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…

Hex and Counter Wargames are adversarial two-player simulations of real military conflicts requiring complex strategic decision-making. Unlike classical board games, these games feature intricate terrain/unit interactions, unit stacking,…

The disk complex of a surface in a 3-manifold is used to define its {\it topological index}. Surfaces with well-defined topological index are shown to generalize well-known classes, such as incompressible, strongly irreducible, and critical…

To understand the complexity of the dynamic of learning in differential games, we decompose the game into components where the dynamic is well understood. One of the possible tools is Helmholtz's theorem, which can decompose a vector field…

In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each position, called a game value. A game (ruleset) is called universal…

Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…

In this paper, we consider spin systems in three spatial dimensions, and prove that the local Hamiltonian problem for 3D lattices with face-centered cubic unit cells, 4-local translationally-invariant interactions between spin-3/2 particles…

We define hyperbolic Heron triangles (hyperbolic triangles with "rational" side-lengths and area) and parametrize them in two ways as rational points of certain elliptic curves. We show that there are infinitely many hyperbolic Heron…

Bidding chess is a chess variant where instead of alternating play, players bid for the opportunity to move. Generalizing a known result on so-called Richman games, we show that for a natural class of games including bidding chess, each…

The global behaviour of nonlinear systems is extremely important in control and systems theory since the usual local theories will only give information about a system in some neighbourhood of an operating point. Away from that point, the…

Let $S$ be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane $\frac{3+4\pi}{3}$-spanner of $S$ whose vertex degree is at most 3. Let $\Lambda$ be the vertex set of a finite…

Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra,…

We show how a theorem of Sullivan provides a precise mathematical statement of a 3d holographic principle, that is, the hyperbolic structure of a certain class of 3d manifolds is completely determined in terms of the corresponding…

The SO(3) instanton homology recently introduced by the authors associates a finite-dimensional vector space over the field of two elements to every embedded trivalent graph (or "web"). The present paper establishes a skein exact triangle…