Related papers: On 3-terminal positions in Hex

This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…

Let $H$ be a 3-uniform hypergraph. A tournament $T$ defined on $V(T)=V(H)$ is a realization of $H$ if the edges of $H$ are exactly the 3-element subsets of $V(T)$ that induce 3-cycles. We characterize the 3-uniform hypergraphs that admit…

Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies these are nondegenerate maxima, minima, and…

In planar maximally supersymmetric Yang-Mills, we can compute three-point functions at weak coupling using the so-called hexagonalization formalism. The main objects in this framework are called hexagons. We are interested in two sectors of…

We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…

We focus on a branch of region-based spatial logics dealing with affine geometry. The research on this topic is scarce: only a handful of papers investigate such systems, mostly in the case of the real plane. Our long-term goal is to…

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…

The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…

We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from…

We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of…

A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…

We use vector bundles to study the locus of totally mixed Nash equilibria of an $n$-player game in normal form, which we call the Nash equilibrium scheme. When the payoff tensor format is balanced, we study the Nash discriminant variety,…

In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a hypergraph $H$, and Maker wins if and only if she possesses all the vertices of some edge of $H$. Deciding the outcome (i.e. which player has a winning…

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

We address two bottlenecks for concise QBF encodings of maker-breaker positional games, like Hex and Tic-Tac-Toe. Our baseline is a QBF encoding with explicit variables for board positions and an explicit representation of winning…

Understanding the Impossibility of a Tie in Hex via Fixed Point Theorems, the Hex Theorem, and Their Equivalence.

The square root of the threetangle is calculated for the transverse XY-model with an integrability-breaking in-plane field component. To be in a regime of quasi-solvability of the convex roof, here we concentrate here on a 4-site model…

We apply representation theory to study the homology of equivariant Dehn-fillings of a given finite, regular cover of a compact 3-manifold with boundary a torus. This yields a polynomial which gives the rank of the part of the homology…

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…

Let ${\mathcal A}$ be a finite real linear hyperplane arrangement in three dimensions. Suppose further that all the regions of ${\mathcal A}$ are isometric. We prove that ${\mathcal A}$ is necessarily a Coxeter arrangement. As it is well…