ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be a complete graph with an even number of vertices, and let the action be the sum of the edge curvatures. A perfect-matching minimum-action conjecture states that the minimum action for KnK_n is achieved by the perfect-matching setting, in which the action is nn, the number of vertices. This is proposed in analogy with the tree case, while the preceding theorem establishes the maximum action for the constant edge-length setting.

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.