Papers › Computing associators of endomorphism fusion categories
Computing associators of endomorphism fusion categories
Daniel Barter, Jacob C. Bridgeman, Ramona Wolf
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Many applications of fusion categories, particularly in physics, require the associators or F-symbols to be known explicitly. Finding these matrices typically involves solving vast systems of coupled polynomial equations in large numbers of variables. In this work, we present an algorithm that allows associator data for some category with unknown associator to be computed from a Morita equivalent category with known data. Given a module category over the latter, we utilize the representation theory of a module tube category, built from the known data, to compute this unknown associator data. When the input category is unitary, we discuss how to ensure the obtained data is also unitary. We provide several worked examples to illustrate this algorithm. In addition, we include several Mathematica files showing how the algorithm can be used to compute the data for the Haagerup category ℋ₁, whose data was previously unknown.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections