Monotonicity of maximum likelihood degree under facial submatrices

At least 5 years old · documented by

Let A∈Zn×rA \in \mathbb{Z}^{n \times r} and A‾∈Zn×s\overline{A} \in \mathbb{Z}^{n \times s} be a facial submatrix of AA. The facial-submatrix maximum likelihood degree conjecture. The maximum likelihood degree of MA\mathcal{M}_A is greater than or equal to the maximum likelihood degree of MA‾\mathcal{M}_{\overline{A}}. This would extend the preceding theorem on maximum likelihood estimators for facial subsets and express monotonicity of maximum likelihood degree under passage to a facial submatrix; the source does not provide a proof or resolution.

References

Primary source

Jane Ivy Coons and Seth Sullivant, “Quasi-independence models with rational maximum likelihood estimator”, arXiv:2006.06832 (2020).

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.