Graph homology computations
Simon Brun, Thomas Willwacher
TL;DR
This paper presents numerical computations of the homology of various graph complexes at low loop orders, expanding on earlier findings to deepen understanding of their algebraic structures.
Contribution
It introduces new numerical methods for computing graph homology, extending previous results to more complex graph complexes at low loop orders.
Findings
Homology computed for multiple graph complexes
Extended previous results to higher loop orders
Provided numerical data supporting theoretical conjectures
Abstract
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Advanced Combinatorial Mathematics