ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pijkℓp_{ijk\ell} be entries of a 2×2×2×22\times2\times2\times2 table sampled uniformly from the probability simplex, with i,j,k,ℓ∈{0,1}i,j,k,\ell\in\{0,1\} and pijkℓ≥0p_{ijk\ell}\geq0. Consider the two 2×2×22\times2\times2 subtables obtained by fixing ℓ=0\ell=0 and ℓ=1\ell=1, and their sum over ℓ\ell. A Simpson conversion occurs when the two subtables induce the same triangulation of the cube, while their sum induces a different triangulation. The probability conjecture. The probability that a Simpson conversion occurs in this context is 1/4501/450. This is based on computational sampling and is presented as a conjecture about the frequency of Simpson conversions in 2×2×2×22\times2\times2\times2 contingency tables; the corresponding two-dimensional probability is known to be 1/601/60.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.