ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite solvable group. The problems \textscEQN−SAT(G)\textsc{EQN-SAT}(G) and \textscEQN−ID(G)\textsc{EQN-ID}(G) ask, respectively, whether an equation over GG has a satisfying assignment and whether it is an identity over all assignments. Quasipolynomial-time conjecture. Both \textscEQN−SAT(G)\textsc{EQN-SAT}(G) and \textscEQN−ID(G)\textsc{EQN-ID}(G) are decidable in quasipolynomial time. This is presented as a natural weakening of an earlier polynomial-time question after the paper proves ETH-based quasipolynomial lower bounds for some solvable groups; the conjecture remains open in the stated generality.

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.