paper

On representing some lattices as lattices of intermediate subfactors of finite index

arXiv:math/0703248

Abstract

We prove that the very simple lattices which consist of a largest, a smallest and pairwise incomparable elements where 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 at generic levels to be maximal.

39 pages, latex, corrected proof of Cor. 5.23. To appear in Advance in Mathematics

References in corpus (1)