ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an integer d≥1d\geq 1. Let (d1,…,dr)⊢d(d_1,\ldots,d_r)\vdash d range over strictly positive unordered partitions of dd, and let #Aut⁡(d1,…,dr)\#\operatorname{Aut}(d_1,\ldots,d_r) denote the order of the automorphism group of the partition.

Combinatorial identity conjecture. Then

∑(d1,…,dr)⊢d2r−1⋅dr−2#Aut⁡(d1,…,dr)∏i=1r(−1)di−1di(3didi)=1d2(4d−1d).\sum_{(d_1,\ldots,d_r)\vdash d}\dfrac{2^{r-1}\cdot d^{r-2}}{\#\operatorname{Aut}(d_1,\ldots,d_r)}\prod_{i=1}^r\dfrac{(-1)^{d_i-1}}{d_i}{3d_i\choose d_i}=\dfrac{1}{d^2}{4d-1\choose d}.

The paper presents this identity as a purely combinatorial formula equivalent to the first hypergeometric contribution formula, providing theoretical evidence for that conjecture. The supplied text gives no independent resolution of this identity.

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.