Nesbitt–Shapiro inequality at the remaining endpoint values

At least 4 years old · documented by

Let nn be a positive integer, let pp be the number of positive definite matrices in the cyclic sum, and let FpF_p denote the corresponding cyclic expression.

Nesbitt–Shapiro endpoint conjecture. If p=12p=12 or p=23p=23, then

Fp≥p2n.F_p\geq \frac{p}{2}n.

The paper explains that this would, together with the preceding proposition and the known cases, establish the inequality for all remaining values in the stated ranges. The parser provides no evidence that these two cases have been resolved, so their status is open.

References

Primary source

Projesh Nath Choudhury and K. C. Sivakumar, “Nesbitt and Shapiro Cyclic Sum Inequalities for Positive Definite Matrices”, arXiv:2110.10933 (2021).

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.