Conjectural formula for the next-to-leading coefficient of path distance matrices

Let PnP_n be a path on n>5n>5 vertices. Define its characteristic polynomial by

CharPolyDPn(x)=i=02n3aixi.\mathrm{CharPoly}_{\mathfrak{D}_{P_n}}(x)=\sum_{i=0}^{2n-3}a_i x^i.

Coefficient formula conjecture. The coefficient of x2n5x^{2n-5} is

a2n5=16(n1)(n2)(2n2+6n15).a_{2n-5}=-\frac{1}{6}(n-1)(n-2)(2n^2+6n-15).

The formula is proposed from computational data and is intended to estimate the coefficient needed for a lower-bound analysis of the peak location. No proof or resolution is given in the source.

Sources & referencesView supporting material

Primary source

Rakesh Jana, Iswar Mahato and Sivaramakrishnan Sivasubramanian, “Unimodality and peak location of the characteristic polynomials of two distance matrices of trees”, arXiv:2407.03309 (2024).

Additional references

6 papers in this index state this conjecture (2014–2024). The statement above is taken from the most recent of them; the others are arXiv:2312.10910, arXiv:2210.01059, arXiv:1703.06550, arXiv:1703.00271, arXiv:1403.1235.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.