Related papers: Stone type representation theorems via games
We study the complexity of the $KK$-equivalence relation on unital $C^*$-algebras, in the sense of descriptive set theory. We prove that $KK$-equivalence is analytic, which in turn shows that the set of separable $C^*$-algebras satisfying…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
Inspired by earlier works on representations of the Temperley-Lieb algebra we introduce a novel family of representations of the algebra. This may be seen as a generalization of the so called asymmetric twin representation. The underlying…
We show the theory of pointed $\R$-trees with radius at most $r$ is axiomatizable in a suitable continuous signature. We identify the model companion $\rbRT_r$ of this theory and study its properties. In particular, the model companion is…
We present a unified approach, based on dominating families in binary relations, for the study of topological properties defined in terms of selection principles and the games associated to them.
We show that for a large class of varieties of algebras, the equational theory of the congruence lattices of the members is not finitely based.
In this paper we revisit the regular-language representation of game semantics of second-order recursion free Idealized Algol with infinite data types. By using symbolic values instead of concrete ones we generalize the standard notion of…
In this paper, we introduce an agent-based representation of games, in order to propose a compact representation for multi-party games in game theory. Our method is inspired by concepts in process theory and process algebra. In addition, we…
Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…
We prove that a finite dimensional algebra $\Lambda$ is $\tau-$tilting finite if and only if all the bricks over $\Lambda$ are finitely generated. This is obtained as a consequence of the existence of proper locally maximal torsion classes…
Let $K$ be an algebraically closed field of arbitrary characteristic and let $X$ be an irreducible projective variety over $K$. Let $G\subseteq\text{Bir}(X)$ be a bounded-degree subgroup. We prove that there exists an irreducible projective…
This paper studies a new and more general axiomatization than one presented previously for preference on likelihood gambles. Likelihood gambles describe actions in a situation where a decision maker knows multiple probabilistic models and a…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
We show that all finite dimensional, tame hereditary $k$-algebras are of amenable representation type (in the sense of G. Elek) for all fields $k$. The proof is adapted from our previous result for tame path algebras. Further, it is proven…
The notions of a {\em 2-precontact space}\/ and a {\em 2-contact space}\/ are introduced. Using them, new representation theorems for precontact and contact algebras are proved. It is shown that there are bijective correspondences between…
There is a decomposition of a Lie algebra for open matrix chains akin to the triangular decomposition. We use this decomposition to construct unitary irreducible representations. All multiple meson states can be retrieved this way.…
We give evidence for a uniformization-type conjecture, that any algebraic variety can be altered into a variety endowed with a tower of smooth fibrations of relative dimension one.
In this paper we provide a complete algebraic characterization of elementary equivalence of rings with a finitely generated additive group in the language of pure rings. The rings considered are arbitrary otherwise.
Propositional temporal logic over the real number time flow is finitely axiomatisable, but its first-order counterpart is not recursively axiomatisable. We study the logic that combines the propositional axiomatisation with the usual axioms…