Simplicity of twin tree lattices with non-trivial commutation relations

preprint2012arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.