2007/03/09 by Feng Xu, Xu, Feng
Computer Science · Mathematics · Physics and Astronomy · #Advanced Algebra and Logic #Advanced Operator Algebra Research #Geometric and Algebraic Topology #math-ph #math.MP #math.OA #math.QA
paper · pdf · doi:10.48550/arxiv.math/0703248
39 pages, latex, corrected proof of Cor. 5.23. To appear in Advance in Mathematics
arxiv created 2009/05/08 · arxiv updated 2009/12/01
We prove that the very simple lattices which consist of a largest, a smallest and 2n pairwise incomparable elements where n is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite depth. Using the same techniques, we give a necessary and sufficient condition for subfactors coming from Loop groups of type A at generic levels to be maximal.