Classification of Subfactors with the Principal Graph D1n
β Scribed by M. Izumi; Y. Kawahigashi
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 936 KB
- Volume
- 112
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that the number of the conjugacy classes of the AFD type (\mathrm{II}{1}) subfactors with the principal graph (D{n}^{(1)}) is (n-2). This gives the last missing number in the complete classfication list of subfactors with index 4 by (\mathrm{S}). Popa. This also disproves an announcement of (A). Ocneanu that such a subfactor is unique for each (n). We give two different proofs. One is by an application of an idea of an orbifold model in solvable lattice model theory to Ocneanu's paragroup theory and the other is by reduction to classification of dihedral group actions. The latter also shows that the AFD type (\mathrm{III}{1}) subfactors with the principal graph (D{n}^{(1)}) split as type (\mathrm{II}{1}) subfactors tensored with the common AFD type (\mathrm{III}{1}) factor. We also discuss a relation between these proofs and a construction of subfactors using Cuntz algebra endomorphisms. 1993 Academic Press. Inc.
π SIMILAR VOLUMES
## SumARY A direct method for selective deuteration of xanthone 1 employing the lithium salt of 1 ,3-diaminopropane-N,N,N',W-d4 i s descrlbed. Oibenzofuran i s also found to be deuterated selectively under these conditions.
Given two finite posets P and P$ with the same comparability graph, we show that if |V(P)| 4 and if for all x # V(P), P&x & P$&x, then P &P$. This result leads us to characterize the finite posets P such that for all x # V(P), P&x & P\*&x.
The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.
In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n β₯ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.