ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let vv be a string, let Lm(v)L^m(v) denote the length of its shortest grammar, and let MDL⁡(v)\boldsymbol{\operatorname{MDL}}(v) denote the MDL code for vv. Let γ(n):=nf1(n)\gamma(n):=n f_1(n). Symmetrical-bound conjecture. There is an inequality

∣len⁡MDL⁡(v)−γ(Lm(v))∣≤f2(Lm(v)),\left|\operatorname{len}\operatorname{MDL}(v)-\gamma\bigl(L^m(v)\bigr)\right|\leq f_2\bigl(L^m(v)\bigr),

where the functions fi≥0f_i\geq 0 satisfy

0≤fi(n+1)−fi(n)≤cin0\leq f_i(n+1)-f_i(n)\leq \frac{c_i}{n}

for some constants cic_i. This proposed bound is intended to relate the MDL code length to the shortest-grammar length and is used in the paper's heuristic argument about vocabulary and excess code length; the source calls it probable rather than proving it.

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.