Finite generation of graph configuration-space homology as a topological graph-injection module

About 3 years old · traced to

For a graph GG, let Fn(G)F_n(G) be the configuration space of nn ordered points in GG, and let cmathcalTGIcmathcal{TGI} be the category of topological graph embeddings. The assignment G↦Hi(Fn(G))G\mapsto H_i(F_n(G)) defines a cmathcalTGIcmathcal{TGI}-module. Universal finite generation conjecture. For any natural numbers ii and nn, the cmathcalTGIcmathcal{TGI}-module Hi(Fn(∙))H_i(F_n(\bullet)) is finitely generated. This is a categorical reformulation of universal finite generation for all graphs. It is supported by known cases, including i=1i=1 for all graphs and several restricted graph classes, but remains open in general.

References

Primary source

Ben Knudsen and Eric Ramos, “Robertson's conjecture and universal finite generation in the homology of graph braid groups”, arXiv:2305.19363 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.