Skip to main content

Finiteness Properties of \(\mathbf{G}(\mathbb{F}_{q}[t,t^{-1}])\)

  • Chapter
  • First Online:
Finiteness Properties of Arithmetic Groups Acting on Twin Buildings

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 2109))

  • 674 Accesses

Abstract

Let G be a connected, non-commutative, absolutely almost simple \(\mathbb{F}_{q}\)-group. In this chapter we want to determine the finiteness length of \(\mathbf{G}(\mathbb{F}_{q}[t,t^{-1}])\). We have already seen that there is a locally finite irreducible Euclidean twin building on which the group acts strongly transitively so in geometric language we have to show

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

References

  1. Bux, K.U., Wortman, K.: Connectivity properties of horospheres in Euclidean buildings and applications to finiteness properties of discrete groups. Invent. Math. 185, 395–419 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Witzel, S. (2014). Finiteness Properties of \(\mathbf{G}(\mathbb{F}_{q}[t,t^{-1}])\) . In: Finiteness Properties of Arithmetic Groups Acting on Twin Buildings. Lecture Notes in Mathematics, vol 2109. Springer, Cham. https://doi.org/10.1007/978-3-319-06477-2_3

Download citation

Publish with us

Policies and ethics