ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A threshold function is a map f:ΣN→Σf:\Sigma^N\to\Sigma, where Σ\Sigma 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 nn-dimensional function is an extrusion of a lower-dimensional function if it ignores an added variable, namely fe(s0,…,sn):=f(s1,…,sn)f^e(s_0,\ldots,s_n):=f(s_1,\ldots,s_n). Let G(N,M)\mathcal G(N,M) denote the Ising symmetry group acting on threshold functions; write AND⁡sd\operatorname{AND}^{sd} for the self-dualization of the AND gate. Classification conjecture. Up to G(N,M)\mathcal G(N,M) action, the only strongly-neutralizable threshold functions of dimension at least 22 that are not extrusions of lower-dimensional functions are the AND gate and its self-dualization AND⁡sd\operatorname{AND}^{sd}. This conjecture would classify the non-redundant strongly-neutralizable threshold functions. The authors report that they have checked the claim only through dimension 77, 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 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.