Related papers: On 3-terminal positions in Hex
The goals of this work are two-fold: firstly, to propose a new theoretical framework for representing random fields on a large class of multidimensional geometrical domain in the tensor train format; secondly, to develop a new algorithm…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…
The transfer matrix is a powerful technique that can be applied to statistical mechanics systems as, for example, in the calculus of the entropy of the ice model. One interesting way to study such systems is to map it onto a 3-color…
A 3-manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite fundamental group has a finite cover which is Haken. In this paper, we study random…
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
Reversible Boolean Circuits are an interesting computational model under many aspects and in different fields, ranging from Reversible Computing to Quantum Computing. Our contribution is to describe a specific class of Reversible Boolean…
We present theoretical and experimental results probing the rich topological structure of arbitrarily disordered finite tight binding Hamiltonians with chiral symmetry. We extend the known classification by considering the topological…
The problem of determining the set of possible eigenvalues of 3 Hermitian matrices that sum up to zero is known as the Horn problem. The answer is a polyhedral cone, which, following Knutson and Tao, can be described as the projection of a…
This paper investigates the cuspidal configurations of 3-RPR parallel manipulators that may appear on their singular surfaces in the joint space. Cusp points play an important role in the kinematic behavior of parallel manipulators since…
This thesis presents some geometric insights into three different types of two player prediction games -- namely general learning task, prediction with expert advice, and online convex optimization. These games differ in the nature of the…
The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…
DeepMind's recent spectacular success in using deep convolutional neural nets and machine learning to build superhuman level agents --- e.g. for Atari games via deep Q-learning and for the game of Go via Reinforcement Learning --- raises…
We extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space. We prove that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree.
We study zero-sum turn-based games on graphs. In this note, we show the existence of a game objective that is $\mathbf{\Pi}^0_3$-complete for the Borel hierarchy and that is positional, i.e., for which positional strategies suffice for the…
This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules. We introduce and investigate taking-and-merging games, that is, where…
Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…
We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…
The formulation of hypermultiplets that has been developed for 5-dimensional matter multiplets is by dimensional reductions translated into the appropriate spinor language for 6 and 4 dimensions. We also treat the theories without actions…
Conventional wisdom holds that any region of 3-space contains infinitely many points, and the Planck length scale determines the uncertainty in every measurement of distance between two separate points. Against such a backdrop, this…