ORPP logo
Image from Google Jackets

Quadratic Isoperimetric Inequality for Mapping Tori of Free Group Automorphisms.

By: Contributor(s): Material type: TextTextSeries: Memoirs of the American Mathematical SocietyPublisher: Providence : American Mathematical Society, 2010Copyright date: ©2009Edition: 1st edDescription: 1 online resource (170 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781470405694
Subject(s): Genre/Form: Additional physical formats: Print version:: Quadratic Isoperimetric Inequality for Mapping Tori of Free Group AutomorphismsDDC classification:
  • 512.2
LOC classification:
  • QA183 -- .B75 2009eb
Online resources:
Contents:
Intro -- Contents -- Abstract -- Introduction -- Acknowledgements -- Part 1. Positive Automorphisms -- 1.1. Van Kampen diagrams -- 1.2. Singularities and bounded cancellation -- 1.3. Past, future and colour -- 1.4. Strategy, strata and conditioning -- 1.5. Preferred futures, fast letters and cancellation -- 1.6. Counting non-constant letters -- 1.7. The bound on S0|A4(S0,)| and S0|A2(S0,)| -- 1.8. The pleasingly rapid consumption of colours -- 1.9. Teams and their associates -- 1.10. The Bonus Scheme -- 1.11. The proof of Theorem C -- 1.12. Glossary of constants -- Part 2. Train Tracks and the Beaded Decomposition -- 2.1. Improved relative train track maps -- 2.2. Hard splittings -- 2.3. A small reduction -- 2.4. Nibbled futures -- 2.5. Passing to an iterate of f -- 2.6. The nibbled futures of GEP s -- 2.7. Proof of the Beaded Decomposition Theorem -- 2.8. Refinements of the Beaded Decomposition Theorem -- Part 3. The General Case -- 3.1. The structure of diagrams -- 3.2. Adapting diagrams to the beaded decomposition -- 3.3. Linear bounds on the length of corridors -- 3.4. Replacing f by a suitable iterate -- 3.5. Preferred futures of beads -- 3.6. Counting fast beads -- 3.7. HNP-cancellation and reapers -- 3.8. Non-fast and unbounded beads -- 3.9. The pleasingly rapid disappearance of colours -- 3.10. Teams -- 3.11. The Bonus Scheme -- 3.12. From bead norm to length -- 3.13. Corridor length functions and bracketing -- 3.14. On a result of Brinkmann -- Bibliography -- Index.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Intro -- Contents -- Abstract -- Introduction -- Acknowledgements -- Part 1. Positive Automorphisms -- 1.1. Van Kampen diagrams -- 1.2. Singularities and bounded cancellation -- 1.3. Past, future and colour -- 1.4. Strategy, strata and conditioning -- 1.5. Preferred futures, fast letters and cancellation -- 1.6. Counting non-constant letters -- 1.7. The bound on S0|A4(S0,)| and S0|A2(S0,)| -- 1.8. The pleasingly rapid consumption of colours -- 1.9. Teams and their associates -- 1.10. The Bonus Scheme -- 1.11. The proof of Theorem C -- 1.12. Glossary of constants -- Part 2. Train Tracks and the Beaded Decomposition -- 2.1. Improved relative train track maps -- 2.2. Hard splittings -- 2.3. A small reduction -- 2.4. Nibbled futures -- 2.5. Passing to an iterate of f -- 2.6. The nibbled futures of GEP s -- 2.7. Proof of the Beaded Decomposition Theorem -- 2.8. Refinements of the Beaded Decomposition Theorem -- Part 3. The General Case -- 3.1. The structure of diagrams -- 3.2. Adapting diagrams to the beaded decomposition -- 3.3. Linear bounds on the length of corridors -- 3.4. Replacing f by a suitable iterate -- 3.5. Preferred futures of beads -- 3.6. Counting fast beads -- 3.7. HNP-cancellation and reapers -- 3.8. Non-fast and unbounded beads -- 3.9. The pleasingly rapid disappearance of colours -- 3.10. Teams -- 3.11. The Bonus Scheme -- 3.12. From bead norm to length -- 3.13. Corridor length functions and bracketing -- 3.14. On a result of Brinkmann -- Bibliography -- Index.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.

© 2024 Resource Centre. All rights reserved.