The quadratic isoperimetric inequality for mapping tori of free group automorphisms
Author(s)
Bibliographic Information
The quadratic isoperimetric inequality for mapping tori of free group automorphisms
(Memoirs of the American Mathematical Society, no. 955)
American Mathematical Society, c2009
Available at 12 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
"Volume 203, number 955 (fourth of 5 numbers)."
Includes bibliographical references (p. 149-150) and index
Description and Table of Contents
Description
The authors prove that if $F$ is a finitely generated free group and $\phi$ is an automorphism of $F$ then $F\rtimes_\phi\mathbb Z$ satisfies a quadratic isoperimetric inequality. The authors' proof of this theorem rests on a direct study of the geometry of van Kampen diagrams over the natural presentations of free-by-cylic groups. The main focus of this study is on the dynamics of the time flow of $t$-corridors, where $t$ is the generator of the $\mathbb Z$ factor in $F\rtimes_\phi\mathbb Z$ and a $t$-corridor is a chain of 2-cells extending across a van Kampen diagram with adjacent 2-cells abutting along an edge labelled $t$. The authors prove that the length of $t$-corridors in any least-area diagram is bounded by a constant times the perimeter of the diagram, where the constant depends only on $\phi$. The authors' proof that such a constant exists involves a detailed analysis of the ways in which the length of a word $w\in F$ can grow and shrink as one replaces $w$ by a sequence of words $w_m$, where $w_m$ is obtained from $\phi(w_{m-1})$ by various cancellation processes. In order to make this analysis feasible, the authors develop a refinement of the improved relative train track technology due to Bestvina, Feighn and Handel. Table of Contents: Positive automorphisms; Train tracks and the beaded decomposition; The General Case; Bibliography; Index. (MEMO/203/955)
by "Nielsen BookData"