
Algorithms and Computation in Mathematics
By: Sergei Matveev
Hardcover | 13 August 2007 | Edition Number 2
At a Glance
508 Pages
Revised
23.5 x 15.88 x 3.18
Hardcover
$139.00
or 4 interest-free payments of $34.75 with
orShips in 5 to 7 business days
From the reviews of the 1st edition:
"This book provides a comprehensive and detailed account of different topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to combine the pedagogical approach of a graduate textbook (without exercises) with the completeness and reliability of a research monograph...
All the material, with few exceptions, is presented from the peculiar point of view of special polyhedra and special spines of 3-manifolds. This choice contributes to keep the level of the exposition really elementary.
In conclusion, the reviewer subscribes to the quotation from the back cover: "the book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers".
Zentralblatt fur Mathematik 2004
For this 2nd edition, new results, new proofs, and commentaries for a better orientation of the reader have been added. In particular, in Chapter 7 several new sections concerning applications of the computer program "3-Manifold Recognizer" have been included.
Industry Reviews
From the reviews of the first edition:
"This book provides a comprehensive and detailed account of different topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in Computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to combine the pedagogical approach of a graduate textbook (without exercises) with the completeness and reliability of a research monograph. This motivates the about 400 pages length of the main text.
All the material, with few exceptions, is presented from the peculiar point of view of special polyhedra and special spines of 3-manifolds. This choice contributes to keep the level of the exposilion really elementary. ....
In conclusion, the reviewer subscribes to the quotation from the back cover: "the book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers".
Riccardo Piergallini (Camerino), Zentralblatt fuer Mathematik 1048 (2004)
"The purpose of the book is to present a detailed overview of the algorithmis aspects of 3-manifold topology. As noted by the author, the book is largely self-contained, though basic topology and group theory are assumed. The book contains extensive references, as the author makes use of many statemants from primary sources, and a large number of figures that help the reader follow the exposition. On the whole, the book is well organized. ..."
James W. Anderson, Mathematical Reviews, Clippings from Issue 2004i
"Almost coincident with the 1985 publication of the first edition of Gerard Burde and Heiner Zieschang's otherwise magisterial Knots, V. Jones's revolutionary "polynomial invariants" blew that subject wide open. History now repeats itself. ... Just asMatveev ... provides a state-of-the-art fast track into all the mathematics surrounding the notorious Poincare ... conjecture, G. Perelman appears to have proved not only the Poincare conjecture, but the whole Thurston geometrization conjecture, holy grail of three-dimensional topology. ... Summing up: Recommended. Upper-division undergraduates through faculty."
D.V. Feldman, Choice - Current Reviews for College Libraries 2003
From the reviews of the second edition:
"The aim of this fine book is to study the algorithmic topology of low-dimensional manifolds ... . The book is written in a very accurate and readable style. ... It looks like as a selfcontained and fundamental work on the algorithmic 3-dimensional topology both for graduate students and researchers. ... This is a book I am very happy to have, and it is heartily recommended to anyone interested in studying topology of 3-manifolds from an algorithmic point of view." (Alberto Cavicchioli, Zentralblatt MATH, Vol. 1128 (6), 2008)
| Simple and Special Polyhedra | p. 1 |
| Spines of 3-Manifolds | p. 1 |
| Collapsing | p. 1 |
| Spines | p. 2 |
| Simple and Special Polyhedra | p. 4 |
| Special Spines | p. 5 |
| Special Polyhedra and Singular Triangulation | p. 10 |
| Elementary Moves on Special Spines | p. 13 |
| Moves on Simple Polyhedra | p. 14 |
| 2-Cell Replacement Lemma | p. 19 |
| Bubble Move | p. 22 |
| Marked Polyhedra | p. 25 |
| Special Polyhedra Which are not Spines | p. 30 |
| Various Notions of Equivalence for Polyhedra | p. 31 |
| Moves on Abstract Simple Polyhedra | p. 35 |
| How to Hit the Target Without Inverse U-Turns | p. 43 |
| Zeeman's Collapsing Conjecture | p. 46 |
| Complexity Theory of 3-Manifolds | p. 59 |
| What is the Complexity of a 3-Manifold? | p. 60 |
| Almost Simple Polyhedra | p. 60 |
| Definition and Estimation of the Complexity | p. 62 |
| Properties of Complexity | p. 67 |
| Converting Almost Simple Spines into Special Ones | p. 67 |
| The Finiteness Property | p. 70 |
| The Additivity Property | p. 71 |
| Closed Manifolds of Small Complexity | p. 72 |
| Enumeration Procedure | p. 72 |
| Simplification Moves | p. 74 |
| Manifolds of Complexity [Less than not equal] 6 | p. 76 |
| Graph Manifolds of Waldhausen | p. 83 |
| Properties of Graph Manifolds | p. 83 |
| Manifolds of Complexity [Less than not equal]8 | p. 89 |
| Hyperbolic Manifolds | p. 97 |
| Hyperbolic Manifolds of Complexity 9 | p. 97 |
| Lower Bounds of the Complexity | p. 100 |
| Logarithmic Estimates | p. 101 |
| Complexity of Hyperbolic 3-Manifolds | p. 104 |
| Manifolds Having Special Spines with One 2-Cell | p. 105 |
| Haken Theory of Normal Surfaces | p. 107 |
| Basic Notions and Haken's Scheme | p. 107 |
| Theory of Normal Curves | p. 110 |
| Normal Curves and Normal Equations | p. 110 |
| Fundamental Solutions and Fundamental Curves | p. 114 |
| Geometric Summation | p. 115 |
| An Alternative Approach to the Theory of Normal Curves | p. 119 |
| Normal Surfaces in 3-Manifolds | p. 123 |
| Incompressible Surfaces | p. 123 |
| Normal Surfaces in 3-Manifolds with Boundary Pattern | p. 126 |
| Normalization Procedure | p. 127 |
| Fundamental Surfaces | p. 134 |
| Geometric Summation | p. 135 |
| Normal Surfaces in Handle Decompositions | p. 138 |
| Applications of the Theory of Normal Surfaces | p. 147 |
| Examples of Algorithms Based on Haken's Theory | p. 147 |
| Recognition of Splittable Links | p. 148 |
| Getting Rid of Clean Disc Patches | p. 150 |
| Recognizing the Unknot and Calculating the Genus of a Circle in the Boundary of a 3-Manifold | p. 157 |
| Is M[superscript 3] Irreducible and Boundary Irreducible? | p. 160 |
| Is a Proper Surface Incompressible and Boundary Incompressible? | p. 163 |
| Is M[superscript 3] Sufficiently Large? | p. 166 |
| Cutting 3-Manifolds along Surfaces | p. 176 |
| Normal Surfaces and Spines | p. 176 |
| Triangulations vs. Handle Decompositions | p. 188 |
| Algorithmic Recognition of S[superscript 3] | p. 191 |
| Links in a 3-Ball | p. 192 |
| Compressing Discs and One-legged Crowns | p. 192 |
| Thin Position of Links | p. 195 |
| The Rubinstein Theorem | p. 199 |
| 2-Normal Surfaces | p. 199 |
| Proof of the Rubinstein Theorem | p. 203 |
| The Algorithm | p. 209 |
| Classification of Haken 3-Manifolds | p. 213 |
| Main Theorem | p. 213 |
| The Waldhausen Theorem | p. 216 |
| Deforming Homotopy Equivalences of Surfaces | p. 217 |
| Deforming Homotopy Equivalences of 3-Manifolds to Homeomorphisms | p. 218 |
| Finiteness Properties for Surfaces | p. 224 |
| Two Reformulations of the Recognition Theorem | p. 224 |
| Abstract Extension Moves | p. 227 |
| First Finiteness Property and a Toy Form of the Second | p. 228 |
| Second Finiteness Property for Simple 3-Manifolds | p. 231 |
| Jaco-Shalen-Johannson Decomposition | p. 240 |
| Improving Isotopy that Separates Surfaces | p. 241 |
| Does M[superscript 3] Contain Essential Tori and Annuli? | p. 245 |
| Different Types of Essential Tori and Annuli | p. 248 |
| JSJ-Decomposition Exists and is Unique | p. 261 |
| Seifert and I-Bundle Chambers | p. 264 |
| Third Finiteness Property | p. 271 |
| Extension Moves | p. 273 |
| Description of General Extension Moves | p. 273 |
| Structure of Chambers | p. 281 |
| Special Extension Moves: Easy Case | p. 286 |
| Difficult Case | p. 294 |
| Recognition of Simple Stallings Manifolds with Periodic Monodromy | p. 298 |
| Recognition of Simple Stallings Manifolds with Nonperiodic Monodromy | p. 303 |
| Recognition of Quasi-Stallings Manifolds | p. 307 |
| Subdivision of Solid Tori | p. 312 |
| Proof of the Recognition Theorem | p. 320 |
| 3-Manifold Recognizer | p. 327 |
| Computer Presentation of 3-Manifolds | p. 327 |
| Cell Complexes | p. 328 |
| 3-Manifolds as Thickened Spines | p. 330 |
| Simplifying Manifolds and Spines | p. 332 |
| Coordinate Systems on Tori | p. 332 |
| Reduction of Cell Structures | p. 334 |
| Collapses | p. 335 |
| Surgeries | p. 336 |
| Disc Replacement Moves | p. 343 |
| Labeled Molecules | p. 347 |
| What is a Labeled Molecule? | p. 347 |
| Creating a Labeled Molecule | p. 349 |
| Assembling Seifert Atoms | p. 351 |
| The Algorithm | p. 354 |
| Tabulation | p. 355 |
| Comments on the Table | p. 357 |
| Hyperbolic Manifolds up to Complexity 12 | p. 358 |
| Why the Table Contains no Duplicates? | p. 360 |
| Other Applications of the 3-Manifold Recognizer | p. 362 |
| Enumeration of Heegaard Diagrams of Genus 2 | p. 362 |
| 3-Manifolds Represented by Crystallizations with [Less than not equal] 32 Vertices | p. 365 |
| Classification of Crystallizations of Genus 2 | p. 367 |
| Recognition of Knots and Unknots | p. 370 |
| Two-Step Enumeration of 3-Manifolds | p. 371 |
| Relative Spines and Relative Complexity | p. 372 |
| Assembling | p. 377 |
| Modified Enumeration of Manifolds and Spines | p. 380 |
| The Turaev-Viro Invariants | p. 383 |
| The Turaev-Viro Invariants | p. 383 |
| The Construction | p. 383 |
| Turaev-Viro Type Invariants of Order r [Less than not equal] 3 | p. 386 |
| Construction and Properties of the [epsilon]-Invariant | p. 392 |
| Turaev-Viro Invariants of Order r [Greater than not equal] 3 | p. 395 |
| Computing Turaev-Viro Invariants | p. 402 |
| More on [epsilon]-Invariant | p. 407 |
| 3-Manifolds Having the Same Invariants of Turaev-Viro Type | p. 409 |
| Appendix | p. 421 |
| Manifolds of Complexity [Less than not equal] 6 | p. 421 |
| Minimal Spines of Manifolds up to Complexity 6 | p. 426 |
| Minimal Spines of Some Manifolds of Complexity 7 | p. 454 |
| Tables of Turaev-Viro Invariants | p. 461 |
| References | p. 481 |
| Index | p. 489 |
| Table of Contents provided by Ingram. All Rights Reserved. |
ISBN: 9783540458982
ISBN-10: 3540458980
Series: Algorithms and Computation in Mathematics
Published: 13th August 2007
Format: Hardcover
Language: English
Number of Pages: 508
Audience: General Adult
Publisher: Springer Nature B.V.
Country of Publication: DE
Edition Number: 2
Edition Type: Revised
Dimensions (cm): 23.5 x 15.88 x 3.18
Weight (kg): 0.88
Shipping
| Standard Shipping | Express Shipping | |
|---|---|---|
| Metro postcodes: | $9.99 | $14.95 |
| Regional postcodes: | $9.99 | $14.95 |
| Rural postcodes: | $9.99 | $14.95 |
Orders over $89.00 qualify for free shipping.
How to return your order
At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.
Additional postage charges may be applicable.
Defective items
If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.
For more info please visit our Help Centre.
You Can Find This Book In
This product is categorised by
- Non-FictionMathematicsTopology
- Non-FictionMathematicsApplied Mathematics
- Non-FictionComputing & I.T.Computer Programming & Software DevelopmentAlgorithms & Data Structures
- Non-FictionMathematicsGeometryDifferential & Riemannian Geometry
- Non-FictionComputing & I.T.Computer ScienceMathematical Theory of ComputationMaths for Computer Scientists
- Non-FictionMathematicsAlgebra

























