Related papers: Multiplayer Rock-Paper-Scissors
For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…
We present an index theory of equilibria for extensive form games. This requires developing an index theory for games where the strategy sets of players are general polytopes and their payoff functions are multiaffine in the product of…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…
We classify gradings on matrix algebras by a finite abelian group. A grading is called good if all elementary matrices are homogeneous. For cyclic groups, all gradings on a matrix algebra over an algebraically closed field are good. We can…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…
We give a detailed description of the torsors that correspond to multiloop algebras. These algebras are twisted forms of simple Lie algebras extended over Laurent polynomial rings. They play a crucial role in the construction of Extended…
This is a survey paper on commutative Koszul algebras and Castelnuovo-Mumford regularity. We describe several techniques to establish the Koszulness of algebras. We discuss variants of the Koszul property such as strongly Koszul, absolutely…
We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.
We compute the K-theory of a collection of C*-algebras, which we refer to as boundary C*-algebras, arising as the crossed product C*-algebras of lattice actions on the maximal Furstenberg boundaries of symmetric spaces of noncompact type.…
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
Multiplayer games on graphs are at the heart of theoretical descriptions of key evolutionary processes that govern vital social and natural systems. However, a comprehensive theoretical framework for solving multiplayer games with an…
Markov chains are an important example for a course on stochastic processes because simple board games can be used to illustrate the fundamental concepts. For example, a looping board game (like Monopoly) consists of all recurrent states,…
We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
The Rock-Scissors-Paper game has been studied to account for cyclic behaviour under various game dynamics. We use a two-person parametrised version of this game. The cyclic behaviour is observed near a heteroclinic cycle, in a heteroclinic…