Classification conjecture for strongly-neutralizable threshold functions

About 3 years old · traced to

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.

References

Primary source

Isaac K. Martin, Andrew G. Moore, John T. Daly, Jess J. Meyer and Teresa M. Ranadive, “Design of General Purpose Minimal-Auxiliary Ising Machines”, arXiv:2310.16246 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.