The i-th Betti number of configuration spaces of 'bunch of grapes' graphs is exactly a polynomial in k for all k, given by a convolution of local first Betti polynomials.
Betti numbers of unordered configuration spaces of small graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort. It contains information for connected multigraphs having at most nine edges which contain no loops, no bivalent vertices, and no internal (i.e., non-leaf) bridges.
fields
math.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hilbert polynomials of configuration spaces over graphs of circumference at most 1
The i-th Betti number of configuration spaces of 'bunch of grapes' graphs is exactly a polynomial in k for all k, given by a convolution of local first Betti polynomials.