Related papers: Quantum Semigroups from Synchronous Games
Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…
We initiate the study of the internal structure of C*-algebras associated to a left cancellative semigroup in which any two principal right ideals are either disjoint or intersect in another principal right ideal; these are variously called…
We discuss a synchronization property for subshifts, that we call $\lambda$-synchronization. Under an irreducibility assumption we associate to a $\lambda$-synchronizing subshift a simple and purely infinite $C^*$-algebra.
We propose a definition of partition quantum spaces. They are given by universal $C^*$-algebras whose relations come from partitions of sets. We ask for the maximal compact matrix quantum group acting on them. We show how those fit into the…
In this paper we introduce an inverse semigroup $\mathcal{S}(E,C)$ associated to a separated graph $(E,C)$ and describe its internal structure. In particular we show that it is strongly $E^*$-unitary and can be realized as a partial…
A collection of partial isometries whose range and initial projections satisfy a specified set of conditions often gives rise to a partial representation of a group. The C*-algebra generated by the partial isometries is thus a quotient of…
We investigate compact quantum group actions on unital $C^*$-algebras by analyzing invariant subsets and invariant states. In particular, we come up with the concept of compact quantum group orbits and use it to show that countable compact…
Connectivity is a homotopy invariant property of separable C*-algebras which has three notable consequences: absence of nontrivial projections, quasidiagonality and a more geometric realization of KK-theory for nuclear C*-algebras using…
We obtain partial affirmative answers to the question whether isomorphism of the unitary groups of two C*-algebras, either as topological groups or as discrete groups, implies isomorphism of the C*-algebras as real C*-algebras.
The paper presents a construction of the crossed product of a C*-algebra by a semigroup of endomorphisms generated by partial isometries.
Let A and B be $C^*$-algebras, A separable, and B $\sigma$-unital and stable. It is shown that there are natural isomorphisms $E(A,B)=KK(SA,Q(B))=[SA,Q(B)\otimes K]$, where $SA=C_0(0,1)\otimes A$, $[\cdot,\cdot]$ denotes the set of homotopy…
The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum…
We show that semigroup C*-algebras are groupoid C*-algebras.
Quasi *-algebras possessing a sufficient family $\mathcal{M}$ of invariant positive sesquilinear forms carry several topologies related to $\mathcal{M}$ which make every *-representation continuous. This leads to define the class of locally…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
We study the semigroup C*-algebra of a positive cone P of a weakly quasi-lattice ordered group. That is, P is a subsemigroup of a discrete group G with P\cap P^{-1}=\{e\} and such that any two elements of P with a common upper bound in P…
A certain synchronizing property for subshifts called $\lambda$-synchronization yields $\lambda$-graph systems called the $\lambda$-synchronizing $\lambda$-graph systems for the subshifts. The $\lambda$-synchronizing $\lambda$-graph system…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…
We give an overview of some recent developments in semigroup C*-algebras.
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…