2000 character limit reached
Flat matrix models for quantum permutation groups
Published 14 Feb 2016 in math.OA and math.PR | (1602.04456v3)
Abstract: We study the matrix models $\pi:C(S_N+)\to M_N(C(X))$ which are flat, in the sense that the standard generators of $C(S_N+)$ are mapped to rank 1 projections. Our first result is a generalization of the Pauli matrix construction at $N=4$, using finite groups and 2-cocycles. Our second result is the construction of a universal representation of $C(S_N+)$, inspired from the Sinkhorn algorithm, that we conjecture to be inner faithful.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.