Related papers: Building relativized representations using games

It is shown that if a bipartite behavior admits a field representation in which Alice (or Bob's) observable algebra generates a purely atomic von Neumann algebra then it is non-relativistic.

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

In Chapter 4 of [25] Triebel proved two theorems concerning pointwise multipliers and diffeomorphisms in function spaces of Besov and Triebel-Lizorkin type. In each case he presented two approaches, one via atoms and one via local means.…

We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Relatively dominated representations give a common generalization of geometrically finiteness in rank one on the one hand, and the Anosov condition which serves as a higher-rank analogue of convex cocompactness on the other. This note…

We introduce a general systematic procedure for solving any binary-input binary-output game using operator algebraic techniques on the representation theory for the underlying group, which we then illustrate on the prominent class of tilted…

We state and prove Kuhn's equivalence theorem for a new representation of games, the intrinsic form. First, we introduce games in intrinsic form where information is represented by $\sigma$-fields over a product set. For this purpose, we…

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…

In this paper, we describe the irreducible representations and give a dimension formula for the Framisation of the Temperley-Lieb algebra. We then prove that the Framisation of the Temperley-Lieb algebra is isomorphic to a direct sum of…

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…

We give a characterization of connected solvable groups in terms of the existence of representations with certain geometric properties. The existence of such representations for the group of upper triangular matrices played an important…

We classify all irreducible admissible representations of three Olshanski pairs connected to the infinite symmetric group. In particular, our methods yield two simple proofs of the classical Thoma's description of the characters of the…

A brief survey of some basic ideas of the so-called Idempotent Mathematics is presented; an "idempotent" version of the representation theory is discussed. The Idempotent Mathematics can be treated as a result of a dequantization of the…

Oftentimes, the Shapley value becomes infeasible for games with many players. However, establishing symmetry allows for polynomial-time computation. To examine this reduction, we identify the spectrum of homogeneous group games by using an…

We combine the parametric Barvinok algorithm with a generation algorithm for a finite list of suitably chosen discrete sub-cases on the enumeration of complete simple games, i.e. a special subclass of monotone Boolean functions. Recently,…

We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…

This paper has two main purposes. Firstly we generalise Ram's explicit construction of calibrated representations of the affine Hecke algebra to the multi-parameter case (including the non-reduced $BC_n$ case). We then derive the Plancherel…