ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path graph on nn vertices, let Pn2P_n^2 denote its square, and let βk(k+r)\beta_k(k+r) be the unique nonzero Betti number of the (r−1)(r-1)-dimensional shellable cut complex 4Δk(Pk+r2)44\Delta_k(P_{k+r}^2)4 for the squared path, where r≥3r\ge 3.

Diagonal recurrence conjecture. For each fixed r≥3r\ge 3 and k≥r+3k\ge r+3, these numbers satisfy

β(k,k+r)=(r1)β(k−1,k−1+r)−(r2)β(k−2,k−2+r)+⋯+(−1)r−1(rr)β(k−r,k−r+r).\beta(k,k+r)=\binom{r}{1}\beta(k-1,k-1+r)-\binom{r}{2}\beta(k-2,k-2+r)+\cdots+(-1)^{r-1}\binom{r}{r}\beta(k-r,k-r+r).

The known values are β(3,n)=(n−42)\beta(3,n)=\binom{n-4}{2}, β(k,k+2)=0\beta(k,k+2)=0, and β(k,k+3)=(k−12)\beta(k,k+3)=\binom{k-1}{2} for k≥3k\ge 3. The first diagonal is already accounted for, while subsequent diagonals agree with identified integer sequences; the recurrence remains conjectural 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.