Strict ML-degree monotonicity under the weak order on matroids

From papers

Let vv and ww be scalings for Pm1×Pn1\mathbb P^{m-1}\times\mathbb P^{n-1}, and define

v^=[Imv],w^=[Imw].\widehat v=[I_m\mid v],\qquad \widehat w=[I_m\mid w].

Let MvM_v and MwM_w be the linear matroids defined by the columns of v^\widehat v and w^\widehat w, respectively, and let S(M)\mathcal S(M) denote the corresponding matroid stratum. Strict weak-order monotonicity conjecture. If v^S(Mv)\widehat v\in\mathcal S(M_v), w^S(Mw)\widehat w\in\mathcal S(M_w), and Mv<MwM_v<M_w, then

mldeg(XA,v)<mldeg(XA,w).\operatorname{mldeg}(X_{A,v})<\operatorname{mldeg}(X_{A,w}).

The claim proposes that ML degree strictly increases along the weak order on matroids; its general validity is open.

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

Oliver Clarke, Serkan Hoşten, Nataliia Kushnerchuk and Janike Oldekop, “Matroid Stratification of ML Degrees of Independence Models”, arXiv:2312.10010 (2024).

Solutions 0

No solutions have been posted yet.