Classification of charge-conserving loop braid representations
Abstract
Here a loop braid representation is a monoidal functor F from the loop braid category L to a suitable target category, and is N-charge-conserving if that target is the category MatchN of charge-conserving matrices (specifically MatchN is the same rank-N charge-conserving monoidal subcategory of the monoidal category Mat used to classify braid representations in arXiv:2112.04533) with F strict, and surjective on N, the object monoid. We classify and construct all such representations. In particular we prove that representations fall into varieties indexed by a set in bijection with the set of pairs of plane partitions of total degree N.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.