ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be an alphabet, let 1≤k<n1\leq k<n, and let g∈Sym(Ak)g\in\mathrm{Sym}(A^k) and h∈Sym(An−k)h\in\mathrm{Sym}(A^{n-k}). Define f∈Sym(An)f\in\mathrm{Sym}(A^n) by

(f1(x),…,fk(x))=g(x1,…,xk)(f_1(x),\ldots,f_k(x))=g(x_1,\ldots,x_k)

and

(fk+1(x),…,fn(x))=h(xk+1,…,xn).(f_{k+1}(x),\ldots,f_n(x))=h(x_{k+1},\ldots,x_n).

Here L(u)\mathcal{L}(u) denotes the minimum instruction length of a program computing the permutation uu. Additive program-length conjecture.

L(f)=L(g)+L(h).\mathcal{L}(f)=\mathcal{L}(g)+\mathcal{L}(h).

This equality would say that independently acting permutations cannot be computed more efficiently by using the other registers as memory. The source presents it as equivalent to fastness of Sym(Ak)×Sym(An−k)\mathrm{Sym}(A^k)\times\mathrm{Sym}(A^{n-k}), but provides no resolution; known shortest programs using additional memory erase the memory content and replace it with functions of the first kk registers.

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.