ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A quasigroup is an algebra whose multiplication table is a Latin square; equivalently, for all elements a,ba,b, there are unique elements x,yx,y such that ax=bax=b and ya=bya=b. The minimum generating set problem asks whether a given quasigroup has a generating set of size at most log⁡n\log n, where nn is the order of the quasigroup.

Papadimitriou–Yannakakis' conjecture. The minimum generating set problem for quasigroups is ∃log⁡2nP\exists^{\log^2 n}\mathsf{P}-complete.

Papadimitriou and Yannakakis established the analogous completeness result for arbitrary magmas and conjectured that completeness persists for the more structured class of quasigroups. The paper reports an unconditional refutation of a version of this conjecture for completeness under quasi-polynomial-size constant-depth reductions, and a refutation under polylogarithmic-space reductions assuming EXP≠PSPACE\mathsf{EXP}\neq\mathsf{PSPACE}, so the conjecture is treated as refuted.

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.