The DOI matches its Crossref record.
Elements of Algebraic Topology
Abstract
Elements of Algebraic Topology provides the most concrete approach to the subject. With coverage of homology and cohomology theory, universal coefficient theorems, Kunneth theorem, duality in manifolds, and applications to classical theorems of point-set topology, this book is perfect for comunicating complex topics and the fun nature of algebraic topology for beginners.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Introduction to Smooth Manifolds
Lee, J. M. (2012) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-9982-5 · Cited by 2,296
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Stability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Transgressing the Boundaries: Toward a Transformative Hermeneutics of Quantum Gravity
Sokal, A. D. (1996) · Social Text · doi:10.2307/466856 · Cited by 1,108
Topological persistence and simplification
Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892133 · Cited by 652
Qi, Y., He, Y., Qi, X., Zhang, Y., & Yang, G. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00558 · Cited by 617
Finding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
Marsden, J. E., & Hirani, A. N. (2003) · arXiv (Cornell University) · doi:10.7907/zhy8-v329 · Cited by 472
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
T-snakes: Topology adaptive snakes
McInerney, T., & Terzopoulos, D. (2000) · Medical Image Analysis · doi:10.1016/s1361-8415(00)00008-6 · Cited by 418
Random Walks, Critical Phenomena, and Triviality in Quantum Field Theory
Fernández, R., Fröhlich, J., & Sokal, A. D. (1992) · Springer eBooks · doi:10.1007/978-3-662-02866-7 · Cited by 337
The union of balls and its dual shape
Edelsbrunner, H. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574053 · Cited by 322
Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape
Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P. V., & Subramaniam, S. (1998) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(19981001)33:1<1::aid-prot1>3.0.co;2-o · Cited by 319
Lipschitz Functions Have L p -Stable Persistence
Cohen-Steiner, D., Edelsbrunner, H., Harer, J., & Mileyko, Y. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9060-6 · Cited by 284
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Homological Connectivity Of Random 2-Complexes
Linial*, N., & Meshulam*, R. (2006) · Combinatorica · doi:10.1007/s00493-006-0027-9 · Cited by 269
Zomorodian, A., & Carlsson, G. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997870 · Cited by 264
Topological models for boundary representation: a comparison with n- generalized maps
Lienhardt, P. (1991) · Computer-Aided Design · doi:10.1016/0010-4485(91)90082-8 · Cited by 259
Stability of persistence diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064133 · Cited by 251
Morse Theory for Filtrations and Efficient Computation of Persistent Homology
Mischaikow, K., & Nanda, V. (2013) · Discrete & Computational Geometry · doi:10.1007/s00454-013-9529-6 · Cited by 252
Gromov‐Hausdorff Stable Signatures for Shapes using Persistence
Chazal, F., Cohen‐Steiner, D., Guibas, L. J., Mémoli, F., & Oudot, S. Y. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01516.x · Cited by 225
Topological Strata of Weighted Complex Networks
Petri, G., Scolamiero, M., Donato, I., & Vaccarino, F. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066506 · Cited by 214
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
A barcode shape descriptor for curve point cloud data
Collins, A., Zomorodian, A., Carlsson, G., & Guibas, L. J. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.015 · Cited by 132
Zomorodian, A., & Carlsson, G. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2008.02.003 · Cited by 89
Shapiro, V. (2002) · Handbook of Computer Aided Geometric Design · doi:10.1016/b978-044451104-1/50021-6 · Cited by 69
Chazal, F., & Lieutier, A. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064132 · Cited by 67
BETTI NUMBERS OF GAUSSIAN FIELDS
Park, C., Pranav, P., Chingangbam, P., Van De Weygaert, R., Jones, B., Vegter, G., Kim, I., Hidding, J., & Hellwing, W. A. (2013) · Journal of The Korean Astronomical Society · doi:10.5303/jkas.2013.46.3.125 · Cited by 62
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
Dumas, J.-G., Heckenbach, F., Saunders, D., & Welker, V. (2003) · Algebra, Geometry and Software Systems · doi:10.1007/978-3-662-05148-1_10 · Cited by 61
The tidy set: a minimal simplicial set for computing homology of clique complexes
Zomorodian, A. (2010) · Proceedings of the twenty-sixth annual symposium on Computational geometry · doi:10.1145/1810959.1811004 · Cited by 52
Exponential random simplicial complexes
Zuev, K., Eisenberg, O., & Krioukov, D. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/46/465002 · Cited by 49
Metadata
- Authors
- Munkres, J. R.
- Venue
- CRC Press eBooks
- Publisher
- CRC Press
- Published
- 2018-03-05
- OpenAlex
- W1496383623
- Cited by
- 2,102
- References
- 0
- FWCI
- 24.06
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.