Finite generation of graph configuration-space homology as a topological graph-injection module
Statement
For a graph , let be the configuration space of ordered points in , and let be the category of topological graph embeddings. The assignment defines a -module. Universal finite generation conjecture. For any natural numbers and , the -module is finitely generated. This is a categorical reformulation of universal finite generation for all graphs. It is supported by known cases, including for all graphs and several restricted graph classes, but remains open in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.