Papers
Topics
Authors
Recent
2000 character limit reached

Fusion rules for permutation extensions of modular tensor categories (1909.03003v1)

Published 6 Sep 2019 in math.QA, cond-mat.str-el, math-ph, math.MP, and quant-ph

Abstract: We give a construction and algorithmic description of the fusion ring of permutation extensions of an arbitrary modular tensor category using a combinatorial approach inspired by the physics of anyons and symmetry defects in bosonic topological phases of matter. The definition is illustrated with examples, namely bilayer symmetry defects and $S_3$-extensions of small modular tensor categories like the Ising and Fibonacci theories. An implementation of the fusion algorithm is provided in the form of a Mathematica package. We introduce the notions of confinement and deconfinement of anyons and defects, respectively, which develop the tools to generalize our approach to more general fusion rings of $G$-crossed extensions.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Video Overview

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.