On Symmetric Pseudo-Boolean Functions: Factorization, Kernels and Applications

MaRDI QIDQ6412404zbMATH OpenFDO

Authors Richik Sengupta, Jacob Biamonte

Publication date 29 September 2022

Mathematics Subject Classification ID

Circuits, networks (94C99) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Boolean algebras (Boolean rings) (06E99) Algebraic logic (03G99)

Abstract: A symmetric pseudo-Boolean function is a map from Boolean tuples to real numbers which is invariant under input variable interchange. We prove that any such function can be equivalently expressed as a power series or factorized. The kernel of a pseudo-Boolean function is the set of all inputs that cause the function to vanish identically. Any $n$-variable symmetric pseudo-Boolean function $f(x_1,x_2,dots,x_n)$ has a kernel corresponding to at least one $n$-affine hyperplane, each hyperplane is given by a constraint $su{m}_{l=1}^n{x}_l=lambda$ for $lambdainmathbbC$ constant. We use these results to analyze symmetric pseudo-Boolean functions appearing in the literature of spin glass energy functions (Ising models), quantum information and tensor networks.

This page was built for publication: On Symmetric Pseudo-Boolean Functions: Factorization, Kernels and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412404)