Answers are grounded in this paper and cite their sources.
Let ν > -1 and let jν,n be the nth positive zero of J_ν. For each integer k ≥ 1 the row sum S_n⁽ᵏ⁾(ν) adds the reciprocals of the kth powers of the differences jν,n^2 - jν,m^2, m ≠ n. The cases k = 1 and k = 2 are Calogero's identities (1977). The recursive scheme for every k is that of Ahmed and Muldoon (1983). We prove that each sum is a Laurent polynomial in jν,n⁻² with coefficients in the rational numbers adjoined with ν. The coefficient of the lowest negative power is |B₂ᵣ|/(2r)! when k = 2r, and (2r+1)|B₂ᵣ|/(4 (2r)!) when k = 2r+1. For 0 < ν < 6 the coefficient of jν,n⁻²ᵏ tends to -ν; for ν = 3/2 the limit is -3/2. If ν > 6 is not a multiple of 6, the same coefficient oscillates with exponential amplitude. If ν is a positive multiple of 6, the sequence does not converge. We make no claim about the spectrum of the associated Cauchy operator and no claim about the zeros of the zeta function.
No takes yet. Share an insight, caveat, or question.
Fábio Dayan Soares de Melo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: