ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CjC_j be the Cayley polytope associated with Cayley compositions, and let its normalized volume be

Vol(Cj):=(j−1)! vol(Cj),\mathrm{Vol}(C_j):=(j-1)!\,\mathrm{vol}(C_j),

where vol(Cj)\mathrm{vol}(C_j) is the Euclidean volume of CjC_j. Cayley polytope volume conjecture. For j≥2j\geq 2, Vol(Cj)\mathrm{Vol}(C_j) is equal to the number of labeled connected graphs on j−1j-1 vertices. The conjecture was resolved by Matjaz Konvalinka and Igor Pak by a direct combinatorial argument.

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.