ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A strong USP is a collection of strings with the strong uniquely solvable puzzle property, and the strong USP capacity is the largest constant CC such that there exist strong USPs of size (C−o(1))k(C-o(1))^k and width kk for infinitely many values of kk. The USP capacity equals 3/22/33/2^{2/3}.

Strong USP capacity conjecture. The strong USP capacity equals

3/22/3.3/2^{2/3}.

This would show that strong USPs attain the same asymptotic capacity as USPs and, via the associated group-theoretic construction, would yield matrix multiplication exponent omega=2omega=2. The paper gives a lower bound of 22/32^{2/3} for the strong USP capacity but no matching upper bound beyond the general USP-capacity bound.

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.