Computing $F$-Symbols from Modular Data
We present a strategy for computing the $F$-symbols of unitary modular categories with a self-dual simple generator, starting from their modular data, which almost entirely avoids the non-linear solution of the pentagon equations. The algorithm climbs a ladder of braid group representations on successively more strands of the generator until enough $F$-symbols have been determined to propagate them to a complete solution. The strategy presented is successful in difficult cases through ranks 11 and 12, including $\operatorname{Z}(\mathrm{Haagerup}_3)$, and does not require the category to be multiplicity-free. Although the algorithm is implemented numerically, we describe a reliable means of recovering the exact $F$-symbols, assuming that in some gauge they lie in a given number field, and of certifying every pentagon and hexagon equation exactly. The exotic rank-11 anisotropic modular category B11-00119 (https://anyonatlas.org/data/B11-00119), with largest fusion coefficient 4, is used as a motivating example, for which the solve takes roughly 10 minutes on a laptop. We will continue to add $F$-symbol solutions to https://AnyonAtlas.org as they are completed.
Authors
- Richard Tuddenham
- Julio Parra-Martinez (ORCID: https://orcid.org/0000-0003-0178-1569)
- Jonah Berean-Dutcher
- Clay Cordova
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24753
- Primary Topic
- Algebraic structures and combinatorial models
- Type
- preprint