Les théorèmes d'existence de réseaux associés aux arbres

Translated title of the contribution: The tree lattice existence theorems

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Let X be a locally finite tree, and let G = Aut(X). Then G is a locally compact group. In analogy with Lie groups, Bass and Lubotzky conjectured that G contains lattices, that is, discrete subgroups whose quotient carries a finite invariant measure. Bass and Kulkarni showed that G contains uniform lattices if and only if G is unimodular and G\X is finite. We describe the necessary and sufficient conditions for G to contain lattices, both uniform and non-uniform, answering the Bass-Lubotzky conjectures in full.

Translated title of the contributionThe tree lattice existence theorems
Original languageFrench
Pages (from-to)223-228
Number of pages6
JournalComptes Rendus Mathematique
Volume335
Issue number3
DOIs
StatePublished - Aug 1 2002

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'The tree lattice existence theorems'. Together they form a unique fingerprint.

Cite this