Conjecture on the ML degree of rank-two 3 by n matrices
Let denote the variety of matrices of rank at most , with . ML-degree conjecture. The ML degree of equals
This conjecture concerns the number of complex critical points of the likelihood function for rank-constrained matrices. The supplied text gives no resolution status or further evidence beyond numerical experimentation.
References
- Jonathan Hauenstein, Jose Rodriguez and Bernd Sturmfels, “Maximum Likelihood for Matrices with Rank Constraints”, arXiv:1210.0198 (2013).
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.