ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, let Conf⁡k(Kn)\operatorname{Conf}_k(K_n) denote the ordered configuration space of kk particles on KnK_n, and let SnS_n act by permuting the vertices. Write Spn(1,1)\mathrm{Sp}_n(1,1) for the irreducible SnS_n-representation indexed by the partition (n−2,1,1)(n-2,1,1).

Stable first-homology representation conjecture. For n≥5n\geq 5, there is an isomorphism of SnS_n-representations

H1(Conf⁡k(Kn))≅k Spn(1,1).H_1(\operatorname{Conf}_k(K_n))\cong k\,\mathrm{Sp}_n(1,1).

The conjecture is motivated by computed homology representations for configuration spaces of one, two, and three particles on complete graphs. It predicts a uniform description of first homology for every particle number kk, beyond the cases accessible in the reported computations; no resolution is supplied in the source.

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.