CoChat
Sign Up
Cited by 61Topological and Geometric Data AnalysisPolynomial and algebraic computationHomotopy and Cohomology in Algebraic Topology

The DOI matches its Crossref record; the references it cites are not checked yet.

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms

Dumas, Jean-Guillaume, Heckenbach, Frank, Saunders, David, Welker, Volkmar·2003·Algebra, Geometry and Software Systems
DOI 10.1007/978-3-662-05148-1_10
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-662-05148-1_10

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

The citation lists haven’t been fetched yet

References 40 · Cited by 61

Research works printed but not linked: 37

  1. Eric Babson, Anders Björner, Svante Linusson, John Shareshian and Volkmar Welker Complexes of not i-connected graphs. Topology 38 (1999) 271–299. · DOI
  2. Achim Bachem and Ravindran Kannan. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. 8 499–507 (1979). · DOI
  3. William W. Boone. Certain simple unsolvable problems in group theory. Indig. Math. 16 231–237 (1955).
  4. Alfred Brauer. Limits for the characteristic roots of a matrix. I. Duke Math. J. 13 387–395 (1946). · DOI
  5. Alfred Brauer. Limits for the characteristic roots of a matrix. II. Duke Math. J. 14 21–26 (1947). · DOI
  6. Richard A. Brualdi and Stephen Mellendorf. Regions in the complex plane containing the eigenvalues of a matrix. American Mathematical Monthly 101 975–985 (1994). · DOI
  7. David Eisenbud. Commutative Algebra with a View Toward Algebraic Geometry,Springer, 1993.
  8. Jean-Guillaume Dumas, B. David Saunders and Gilles Villard. On efficient sparse integer matrix Smith normal form computations. J. Symb. Comp. 32 71–99 (2001). · DOI
  9. Pierre Dusart. Autour de la fonction qui compte le nombre de nombres premiers. PhD thesis, Université de Limoges, 1998.
  10. William G. Dwyer. Homology of integral upper-triangular matrices. Proc. Amer. Math. Soc. 94 523–528 (1985).
  11. Wayne Eberly and Erich Kaltofen. On randomized Lanczos algorithms. In Wolfgang W. Küchlin, editor, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, pages 176–183. ACM Press, New York, July 1997. Computing Simplicial Homology 205
  12. Michael L. Fredman and Leonid Khachiyan. On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618–628. · DOI
  13. Joachim von zur Gathen and Jürgen Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 1999.
  14. Mark W. Giesbrecht. Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. Lecture Notes in Comp. Sci. 1122, 173–186. Springer, 1996. · DOI
  15. Gene H. Golub and Charles F. Van Loan. Matrix computations. Johns Hopkins Studies in the Mathematical Sciences. The Johns Hopkins University Press, Baltimore, MD, USA, third edition, 1996.
  16. Melvin Hochster. Cohen-Macaulay rings, combinatorics, and simplicial complexes. Ring Theory II, Proc. 2nd Okla. Conf. 1975. Lecture Notes in Pure and Applied Mathematics. Vol. 26. New York. Marcel Dekker. 171–223 (1977).
  17. Phil Hanlon. A survey of combinatorial problems in Lie algebra homology. Billera, Louis J. (ed.) et al., Formal power series and algebraic combinatorics. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 24, 89–113, 1996. · DOI
  18. Iztok Hozo, Inclusion of poset homology into Lie algebra homology. J. Pure Appl. Algebra 111 169–180 (1996). · DOI
  19. Costas S. Iliopoulos. Worst case bounds an algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix. SIAM J. Comput. 18 (1989) 658–669. · DOI
  20. Costas S. Iliopoulos. Worst case bounds an algorithms for computing the canonical structure of infinite Abelian groups and solving systems of linear diophantine equations. SIAM J. Comput. 18 (1989) 670–678. · DOI
  21. Gil Kalai. Algebraic Shfiting. Computational Commutative Algebra and Combinatorics Advanced Studies in Pure Math., Vol. 33. Tokyo. Math. Soc. of Japan. 121–165 (2002). · DOI
  22. Erich Kaltofen, Wen-Shin Lee and Austin A. Lobo. Early termination in BenOr/Tiwari sparse interpolation and a hybrid of Zippel’s algorithm. In Carlo Traverso, editor, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, Saint Andrews, Scotland, pages 192–201. ACM Press, New York, 2000. · DOI
  23. Volker Kaibel and Marc E. Pfetsch. Some algorithmic problems in polytope theory, this volume, pages 23–47. · DOI
  24. Dimitris Kavvadias and Elias Stavroploulos. Evaluation of an algorithm for the transversal hypergraph problem. in: Proc. 3rd Workshop on Algorithm Engineering (WAE’99), Lecture Notes in Comp. Sci. 1668, Springer, 1999. · DOI
  25. Anthony W. Knapp. Lie Groups, Lie Algebras, and Cohomology, Mathematical Notes 34, Princeton University Press, 1988.
  26. Bertram Kostant. Lie algebra cohomology and the generalized Borel-Weil theorem, Ann. Math. (2) 74 (1961) 329–387. · DOI
  27. James R. Munkres, Elements of Algebraic Topology, Addison-Wesley, Menlo Park, 1984.
  28. James R. Munkres, Topology, 2nd Edition, Prentice Hall, 2000.
  29. Sergey P. Novikov. On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst 44 (1955) 143.
  30. Sarah Rees and Leonard H. Soicher An algorithmic approach to fundamental groups and covers of combinatorial cell complexes J. of Symb. Comp. 29 (2000) 59–77. · DOI
  31. Ernest Sibert, Harold F. Mattson and Paul Jackson. Finite Field Arithmetic Using the Connection Machine. In Richard Zippel, editor, Proceedings of the second International Workshop on Parallel Algebraic Computation, Ithaca, USA, volume 584 of Lecture Notes in Computer Science, 51–61. Springer, 1990.
  32. Arne Storjohann, Near Optimal Algorithms for Computing Smith Normal Forms of Integer Matrices, Lakshman, Y. N. (ed.), Proceedings of the 1996 international symposium, on symbolic and algebraic computation, ISSAC 96, New York, NY: ACM Press. 267–274 (1996). · DOI
  33. Olga Taussky. Bounds for characteristic roots of matrices. Duke Math. J. 15 1043–1044 (1948). · DOI
  34. Vladimir Tuchin. Homologies of complexes of doubly connected graphs. Russian Math. Surveys 52 426–427 (1997). · DOI
  35. Richard S. Varga. Matrix iterative analysis. Number 27 in Springer series in Computational Mathematics. Springer, second edition, 2000.
  36. Michelle Wachs. Topology of matching, chessboard and general bounded degree graph complexes. Preprint 2001.
  37. Douglas H. Wiedemann. Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32 54–62 (1986). · DOI

Metadata

Authors
Dumas, J.-G., Heckenbach, F., Saunders, D., & Welker, V.
Affiliations
  • Friedrich-Alexander-Universität Erlangen-Nürnberg (DE)
  • University of Delaware (US)
  • Philipps University of Marburg (DE)
ORCID
Venue
Algebra, Geometry and Software Systems
Publisher
Springer Berlin Heidelberg
Published
2003
Pages
177-206
DOI
10.1007/978-3-662-05148-1_10
OpenAlex
W1941645695
Cited by
61
References
40
Citations by year
2026: 2 · 2024: 1 · 2023: 1 · 2022: 2 · 2020: 2 · 2019: 4 · 2018: 3 · 2016: 4 · 2015: 1 · 2014: 5 · 2013: 5 · 2012: 4
FWCI
5.58
Type
book chapter
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
  • Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
Keywords
simplicial homology, Smith normal form, sparse matrices, simplicial complexes, integer coefficients, GAP package, Lie algebra homology, computational algebra

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. https://app.cochat.ai/papers/10.1007/978-3-662-05148-1_10
The paper
Dumas, J.-G., Heckenbach, F., Saunders, D., & Welker, V. (2003). Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. Algebra, Geometry and Software Systems. https://doi.org/10.1007/978-3-662-05148-1_10