Advertisement

Existence of Tree Lattices

  • Hyman Bass
  • Alexander Lubotzky
Chapter
  • 344 Downloads
Part of the Progress in Mathematics book series (PM, volume 176)

Abstract

Let X be a locally finite tree, and G = Aut(X). When does X admit a—uniform, or non-uniform—lattice? We would like to answer this in terms of properties of the edge-indexed quotient graph I (G\\X) (cf. (2.4) and (2.5)).

Keywords

Fundamental Group Finite Type Tree Lattice Connected Subgraph Covering Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2001

Authors and Affiliations

  • Hyman Bass
    • 1
  • Alexander Lubotzky
    • 2
  1. 1.Department of MathematicsUniversity of MichiganAnn ArborUSA
  2. 2.Department of MathematicsHebrew UniversityJerusalemIsrael

Personalised recommendations