Generalized Polymorphisms

05/17/2023
by   Gilad Chase, et al.
0

We determine all m-ary Boolean functions f_0,…,f_m and n-ary Boolean functions g_0,…,g_n satisfying the equation f_0(g_1(z_11,…,z_1m),…,g_n(z_n1,…,z_nm)) = g_0(f_1(z_11,…,z_n1),…,f_m(z_1m,…,z_nm)), for all Boolean inputs { z_ij : i ∈ [n], j ∈ [m] }. This extends characterizations by Dokow and Holzman (who considered the case g_0 = ⋯ = g_n) and by Chase, Filmus, Minzer, Mossel and Saurabh (who considered the case g_1 = ⋯ = g_n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

A quantum algorithm to estimate the Gowers U_2 norm and linearity testing of Boolean functions

We propose a quantum algorithm to estimate the Gowers U_2 norm of a Bool...
research
01/10/2018

Distribution of the absolute indicator of random Boolean functions

The absolute indicator is one of the measures used to determine the resi...
research
04/13/2018

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

We analyse the complexity of approximate counting constraint satisfactio...
research
10/20/2020

Sparse reconstruction in spin systems I: iid spins

For a sequence of Boolean functions f_n : {-1,1}^V_n⟶{-1,1}, defined on ...
research
12/04/2018

Optimal Boolean Locality-Sensitive Hashing

For 0 ≤β < α < 1 the distribution H over Boolean functions h {-1, 1}^d →...
research
01/12/2018

Self-Predicting Boolean Functions

A Boolean function g is said to be an optimal predictor for another Bool...
research
07/11/2016

Enhanced Boolean Correlation Matrix Memory

This paper introduces an Enhanced Boolean version of the Correlation Mat...

Please sign up or login with your details

Forgot password? Click here to reset