Minimal Markov basis conjecture for contingency-table margin equations

Let CC denote the set of small conditionals, let J1J-1 be the dimension of the underlying lattice, and consider the coefficient matrix of the Diophantine equation governing the margins. A minimal Markov basis conjecture asserts that, when CC \neq \emptyset, this matrix has a Markov basis consisting of J1J-1 elements; equivalently, its corresponding toric ideal equals the lattice basis ideal. The assumption CC \neq \emptyset is necessary, since the paper gives an example where the claim fails for full conditionals. Supporting examples are included in the paper, but the conjecture is not resolved there.

Sources & referencesView supporting material

Primary source

Aleksandra B. Slavković, Xiaotian Zhu and Sonja Petrović, “Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases”, arXiv:1401.1397 (2014).

Additional references

2 papers in this index state this conjecture (2009–2014). The statement above is taken from the most recent of them; the others are arXiv:0909.0073.

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.