2000 character limit reached
Modular fusion categories with few twists
Published 2 Sep 2025 in math.QA and math.RT | (2509.02501v1)
Abstract: We classify modular fusion categories up to braided equivalence with less than four distinct twists of simple objects by observing that under this assumption, for each positive integer $N$, there are finitely many modular fusion categories of Frobenius-Schur exponent $N$ up to braided equivalence whose twists are a proper subset of the $N\mathrm{th}$ roots of unity.
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.