Conjectural formula for the next-to-leading coefficient of path distance matrices
Conjectural formula for the next-to-leading coefficient of path distance matrices
Let be a path on vertices. Define its characteristic polynomial by
Coefficient formula conjecture. The coefficient of is
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.