Skip to main content

Non-Uniform Lattices on Uniform Trees

  • Chapter
Tree Lattices

Part of the book series: Progress in Mathematics ((PM,volume 176))

  • 552 Accesses

Abstract

Consider a locally finite tree X, a subgroup \(H \leqslant G = Aut(X)\) without inversions, and indexed quotient graph \((A,i) = I(H\backslash \backslash X).\)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Birkhäuser Boston

About this chapter

Cite this chapter

Bass, H., Lubotzky, A. (2001). Non-Uniform Lattices on Uniform Trees. In: Tree Lattices. Progress in Mathematics, vol 176. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2098-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2098-5_9

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-7413-1

  • Online ISBN: 978-1-4612-2098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics