2017
DOI: 10.1007/s00220-017-3003-x
|View full text |Cite
|
Sign up to set email alerts
|

Modular Data for the Extended Haagerup Subfactor

Abstract: A. We compute the modular data (that is, the S and T matrices) for the centre of the extended Haagerup subfactor [BMPS12]. The full structure (i.e. the associativity data, also known as 6-j symbols or F matrices) still appears to be inaccessible. Nevertheless, starting with just the number of simple objects and their dimensions (obtained by a combinatorial argument in [MW14]) we nd that it is surprisingly easy to leverage knowledge of the representation theory of SL(2, Z) into a complete description of the mod… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 31 publications
0
5
0
Order By: Relevance
“…We also notice that the only other quantum group modular tensor category that could possibly have a reverse braided auto-equivalence is C(f 4 , 4). This auto-equivalence has 12 non-fixed simple objects, and we find that the 12×12 block of restricted modular data for C(f 4 , 4) exactly appears in the modular data for the centre of extended Haagerup [23]. Further, we can identify Z 4 ⋉Z 5 as the group component of the modular grafting, and construct a fairly natural looking formula for the modular data of centre of extended Haagerup, starting from the modular data of C(f 4 , 4) and the Drinfeld centre of Z 4 ⋊Z 5 .…”
Section: Future Directions and Applicationsmentioning
confidence: 68%
“…We also notice that the only other quantum group modular tensor category that could possibly have a reverse braided auto-equivalence is C(f 4 , 4). This auto-equivalence has 12 non-fixed simple objects, and we find that the 12×12 block of restricted modular data for C(f 4 , 4) exactly appears in the modular data for the centre of extended Haagerup [23]. Further, we can identify Z 4 ⋉Z 5 as the group component of the modular grafting, and construct a fairly natural looking formula for the modular data of centre of extended Haagerup, starting from the modular data of C(f 4 , 4) and the Drinfeld centre of Z 4 ⋊Z 5 .…”
Section: Future Directions and Applicationsmentioning
confidence: 68%
“…By its nature, our work leads to many questions, including • What is the space of 2D CFTs we can generate from the anyonic chain procedure? Is it possible to associate an RCFT with the (extended) Haagerup subfactor (see, e.g., [46][47][48] for some important work in this direction) thus realizing an old dream of Vaughan Jones? • We saw that when we take k → ∞ in the C in = Rep su(2) int k case, we could end up with an irrational output theory [45].…”
Section: Discussionmentioning
confidence: 99%
“…Given a spherical fusion category C one can compute the FS indicators from the matrix induced from the central induction functor as well as T for the center. Gannon and Morrison have outlined an effective procedure for finding a finite set of possibilities for the central induction and T matrix pairs for the center using the fusion rule of C alone, which often (but not always) yields a unique such pair [GM16]. Given an induction and T -matrix pair that does not actually correspond to a categorification of a given fusion rule, there seems to be no reason a priori why these numbers should live in the right number field suitable for applying the Galois automorphisms in the first place, or that the multiplicities of the eigenvalues should add up to the number as determined by the fusion rules.…”
Section: Rotation Eigenvaluesmentioning
confidence: 99%
“…However, it is desirable to be able to compute the rotation eigenvalues from as little information as possible since there are many situations where the full modular data for the center is not easily accessible. For example, in [GM16], Gannon and Morrison describe a procedure for computing possible modular data for the Drinfel'd centers Z(C) of categorifications C of a given fusion ring. Their algorithm effectively produces finitely many possibilities for the forgetful functor Z(C) → C and the T -matrix of Z(C), but finding the S-matrix requires solving a generally large system of quadratics which may or may not be possible.…”
Section: Introductionmentioning
confidence: 99%