Simplicity of twin tree lattices with non-trivial commutation relations
Group Theory
2012-09-25 v1
Abstract
We prove a simplicity criterion for certain twin tree lattices. It applies to all rank two Kac-Moody groups over finite fields with non-trivial commutation relations, thereby yielding examples of simple non-uniform lattices in the product of two trees.
Keywords
Cite
@article{arxiv.1209.5372,
title = {Simplicity of twin tree lattices with non-trivial commutation relations},
author = {Pierre-Emmanuel Caprace and Bertrand Remy},
journal= {arXiv preprint arXiv:1209.5372},
year = {2012}
}