ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.