1 citations · 2 across the 3 of their papers we have counts for
Showing math.QAShow all
2 papers · 1 filter
math.QA2023★ 1 cited
Graph homology computations
Simon Brun, Thomas Willwacher
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
math.QA2022
Stable cohomology of graph complexes in odd dimensions
Simon Brun, Thomas Willwacher
We study graph complexes related to configuration spaces and diffeomorphism groups of highly connected manifolds of odd dimension. In particular we compute the cohomology in the "h…