Cyclic reciprocal squared-difference conjecture for permutations

From papers

Let nn be a positive integer and let πSn\pi\in\mathfrak{S}_n be a permutation of {1,,n}\{1,\ldots,n\}. Cyclic squared-difference conjecture. If n>11n>11, there is a permutation π\pi such that

k=1n11π(k)2π(k+1)2+1π(n)2π(1)2=0.\sum_{k=1}^{n-1}\frac{1}{\pi(k)^2-\pi(k+1)^2}+\frac{1}{\pi(n)^2-\pi(1)^2}=0.

The paper introduces this as a further conjecture motivated by the preceding non-cyclic squared-difference conjecture, and explicitly distinguishes it from the conjectures of Sun it has just reproduced.

Progress summary

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

Sources & referencesView supporting material

Primary source

Guo-Niu Han, “On the existence of permutations conditioned by certain rational functions”, arXiv:1910.02662 (2019).

Solutions 0

No solutions have been posted yet.