Simplicity of twin tree lattices with non-trivial commutation relations
classification
🧮 math.GR
keywords
latticescommutationnon-trivialrelationssimplicitytreetwinapplies
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.