Graph homology computations

2023/07/24 by Brun, Simon, Willwacher, Thomas · 1 citation
#FOS: Mathematics #Quantum Algebra (math.QA)

paper · doi:10.48550/arxiv.2307.12668

Abstract

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

Cited by

• The 11-loop graph cohomology

Related

• Faster computations of discrete homology
• A definition of graph homology and graph K-theory of algebras
• Computing the Homology of Hypergraphs
• Two-loop part of the rational homotopy of spaces of long embeddings
• Geometric approach to graph magnitude homology