Conjecture on nonnegative coefficients in the highest-weight inner-product recursion

About 8 years old · traced to

Let ∣λ⟩=Ejn(w)−⋯Ej1−∣Λs⟩|\lambda\rangle=E_{j_{n(w)}}^-\cdots E_{j_1}^-|\Lambda_s\rangle be a state in a finite-dimensional irreducible representation, and let nkn_k and Λik\Lambda_i^k denote the coefficients and highest-weight data appearing on the right-hand side of the recursion identity for its inner product. Nonnegativity conjecture. The coefficients satisfy

nk(Λik−(nk−1))≥0.n_k(\Lambda^k_i-(n_k-1))\geq 0.

This conjecture concerns the positivity of the terms governing norms in the proposed recursion algorithm and is intended to support the study of unitarity in finite-dimensional irreducible representations. The supplied text does not state whether the conjecture has been resolved.

References

Primary source

Chuanzhong Li, Zhisheng Liu and Bao Shou, “Inner Product in Highest-Weight Representation”, arXiv:1803.02679 (2024).

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.