The collapsing conjecture for facets of hierarchical model polytopes

Let pqrp\leq q\leq r be positive integers, and let PΔp,q,rP_\Delta^{p,q,r} denote the polytope associated with the hierarchical model in the paper. A facet is obtained by collapsing if it arises from a facet of a smaller table through the paper's collapsing operation.

Collapsing conjecture. Suppose that

pqr.p \leq q \leq r.

Then all facets of PΔp,q,rP_\Delta^{p,q,r} are obtained by collapsing from facets of PΔp,q,qP_\Delta^{p,q,q}.

The conjecture is motivated by computational results summarized in the paper's table, although the authors also exhibit a non-collapsible facet of PΔ4,4,4P_\Delta^{4,4,4}, showing that not every facet arises by collapsing to a binary table. The conjecture remains open in the supplied source.

Sources & referencesView supporting material

Primary source

Nicholas Eriksson, Stephen E. Fienberg, Alessandro Rinaldo and Seth Sullivant, “Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models”, arXiv:math/0405044 (2004).

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.