Quasi-actions on trees II : finite depth Bass-Serre trees
Author(s)
Bibliographic Information
Quasi-actions on trees II : finite depth Bass-Serre trees
(Memoirs of the American Mathematical Society, no. 1008)
American Mathematical Society, c2011
- Other Title
-
Quasi-actions on trees 2
Available at 11 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"November 2011, volume 214, number 1008 (fourth of 5 numbers)."
Includes bibliography (p. 101-103) and index
Description and Table of Contents
Description
This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a finite depth graph of groups is one whose vertex and edge groups are coarse Poincare duality groups. The main theorem says that, under certain hypotheses, if $\mathcal{G}$ is a finite graph of coarse Poincare duality groups, then any finitely generated group quasi-isometric to the fundamental group of $\mathcal{G}$ is also the fundamental group of a finite graph of coarse Poincare duality groups, and any quasi-isometry between two such groups must coarsely preserve the vertex and edge spaces of their Bass-Serre trees of spaces. Besides some simple normalization hypotheses, the main hypothesis is the ``crossing graph condition'', which is imposed on each vertex group $\mathcal{G}_v$ which is an $n$-dimensional coarse Poincare duality group for which every incident edge group has positive codimension: the crossing graph of $\mathcal{G}_v$ is a graph $\epsilon_v$ that describes the pattern in which the codimension 1 edge groups incident to $\mathcal{G}_v$ are crossed by other edge groups incident to $\mathcal{G}_v$, and the crossing graph condition requires that $\epsilon_v$ be connected or empty.
by "Nielsen BookData"