Hilbert polynomials of configuration spaces over graphs of circumference at most 1
Abstract
The k -configuration space Bk of a topological space is the space of sets of k distinct points in . In this paper, we consider the case where is a graph of circumference at most 1. We show that for all k0 , the i -th Betti number of Bk is given by a polynomial Pi(k) in k , called the Hilbert polynomial of . We find an expression for the Hilbert polynomial Pi(k) in terms of those coming from the canonical 1-bridge decomposition of . We also give a combinatorial description of the coefficients of Pi(k).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.