Classification conjecture for strongly-neutralizable threshold functions
Statement
A threshold function is a map , where is the binary state space. A function is strongly neutralizable when it has the property that its associated Ising machine can be made neutralizable under the paper's definition. An -dimensional function is an extrusion of a lower-dimensional function if it ignores an added variable, namely . Let denote the Ising symmetry group acting on threshold functions; write for the self-dualization of the AND gate. Classification conjecture. Up to action, the only strongly-neutralizable threshold functions of dimension at least that are not extrusions of lower-dimensional functions are the AND gate and its self-dualization . This conjecture would classify the non-redundant strongly-neutralizable threshold functions. The authors report that they have checked the claim only through dimension , so the classification remains open beyond that range.
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.