Mizanur Rahaman, Department of Pure Mathematics, University of Waterloo
"Bisynchronous games and factorizable maps"
In the theory of non-local games, the graph isomorphism game stands out to be an intriguing one. Specially when the algebra of this game is considered. This is because this game establishes a close connection between the algebra of the game and the theory of quantum permutation groups. It turns out that the graph isomorphism game is an example of a bisynchronous game. In this talk, I will introduce these games and the corresponding correlations arising from the perfect strategies for such games. Moreover, when the number of inputs is equal to the number of outputs, each bisynchronous correlation gives rise to a completely positive map which will be shown to be factorizable in the sense of Haagerup- Musat. This is a joint work with Vern Paulsen.
MC 5417