Related papers: Games in the matrix
The algebra of supernatural matrices is a key example in the theory of locally finite central simple algebras, which studied in a previous paper of the authors (\cite{Local}). It is also a stand-alone object admits a rich study and various…
To better understand the algebra $\mathcal{M}_n$ of all $n\times n$ complex matrices, we explore the class of accretive matrices. This class has received renowned attention in recent years due to its role in complementing those results…
The goal of this paper is to consider some relations between varieties of representations of groups and varieties of associative algebras. The main emphasis is put on the varieties of representations of groups induced by the varieties of…
The classification of Grassmannian cluster algebras resembles that of regular polygonal tilings. We conjecture that this resemblance may indicate a deeper connection between these seemingly unrelated structures.
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different…
Various notions of joint majorization are examined in continuous matrix algebras. The relative strengths of these notions are established via proofs and examples. In addition, the closed convex hulls of joint unitary orbits are completely…
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…
In linear algebra applications, elementary matrices hold a significant role. This paper presents a diagrammatic representation of all $2^m\times 2^n$-sized elementary matrices in algebraic ZX-calculus, showcasing their properties on…
Matrix game, which is also known as two person zero sum game, is a famous model in game theory. There are some well established theories about it, such as von Neumann minimax theorem. However, almost no literature have reported the…
We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…
In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.
The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two…
The game of SET is one of the best mathematical games ever. It is no wonder that people have tried to generalize it. We discuss existing generalizations of the game of SET to different groups. We concentrate on two types of generalization:…
Associated to a complex Hadamard matrix $H\in M_N(\mathbb C)$ is the complex probability measure $\mu\in\mathcal P(\mathbb C)$ describing the distribution of $\varphi(a,b)=<a,Hb>$, where $a,b\in\mathbb T^N$ are random. This measure is…
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We study automorphism groups of formal matrix algebras. We also consider automorphisms of ordinary matrix algebras (in particular, triangular matrix algebras).
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
The definition of Choi matrices for linear maps on the n x n matrices is extended to factors, and the basic theorems for Choi matrices are proved in this general context.