Sturmfels–Uhler polynomiality conjecture for the maximum likelihood degree

From papers

Let VV be a vector space, let S2V\boldsymbol{S}^2V denote the space of symmetric matrices on VV, and let c6(n,a)c6(n,a) be the maximum likelihood degree associated with symmetric matrices of size nn and a general aa-dimensional linear subspace. Sturmfels and Uhler suggest that, for fixed aa, this invariant is polynomial in nn. Sturmfels\Uhler's polynomiality conjecture. For fixed aa the function c6(n,a)c6(n,a) is a polynomial in nn of degree a1a-1. The theorem preceding the conjecture establishes the formula in several low-dimensional cases and gives all values for n6n\leq 6; the conjecture is presented as an extrapolation from these known values and remains unresolved in the supplied text.

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

Mateusz Michałek, Leonid Monin and Jarosław Wiśniewski, “Maximum likelihood degree, complete quadrics and C^*-action”, arXiv:2004.07735 (2020).

Solutions 0

No solutions have been posted yet.