Strong USP capacity conjecture
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 such that there exist strong USPs of size and width for infinitely many values of . The USP capacity equals .
Strong USP capacity conjecture. The strong USP capacity equals
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 . The paper gives a lower bound of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.