ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given four random variables A,B,C,DA,B,C,D with a probability distribution, define the Ingleton score by

I(A;B∣C)+I(A;B∣D)+I(C;D)−I(A;B)H(ABCD).\frac{I(A;B|C)+I(A;B|D)+I(C;D)-I(A;B)}{H(ABCD)}.

Four-atom conjecture. The lowest possible Ingleton score is approximately −0.089373-0.089373. It is attained by a four-variable distribution with alphabet size two, given by

P(0,0,0,0)=P(1,1,1,1)=αP(0,0,0,0)=P(1,1,1,1)=\alpha P(0,1,0,1)=P(0,1,1,0)=0.5−α,P(0,1,0,1)=P(0,1,1,0)=0.5-\alpha,

where α\alpha takes on a value approximately equal to 0.3504570.350457.

This conjecture identifies a binary four-variable distribution that is claimed to minimize the Ingleton score, a normalized measure of violation of Ingleton's inequality. The parser provides no evidence resolving whether this minimum is indeed globally optimal.

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.