ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥2d\geq 2 and let M(Δ,d)M(\Delta,d) denote the penalty function defined by the minimization over pairs of distributions with entropy difference Δ\Delta. For Δ∈[0,log⁡d]\Delta\in[0,\log d], symmetry inequality conjecture.

M(Δ,d)≥M(−Δ,d).M(\Delta,d)\geq M(-\Delta,d).

Numerical plots for many values of dd support the inequality, and it is consistent with the analytical results established earlier in the paper, but no proof is known. If true, it would imply the stronger lower bound R∗≥M(−(Smax−Smin)/2,d)R^*\geq M(-(S_{max}-S_{min})/2,d) for the universal-coding redundancy.

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.