English

Generalized polymorphisms

Combinatorics 2023-11-21 v2 Discrete Mathematics Computer Science and Game Theory

Abstract

We find all functions f0,f1,,fm ⁣:{0,1}n{0,1}f_0,f_1,\dots,f_m\colon \{0,1\}^n \to \{0,1\} and g0,g1,,gn ⁣:{0,1}m{0,1}g_0,g_1,\dots,g_n\colon \{0,1\}^m \to \{0,1\} satisfying the following identity for all n×mn \times m matrices (zij){0,1}n×m(z_{ij}) \in \{0,1\}^{n \times m}: f0(g1(z11,,z1m),,gn(zn1,,znm))=g0(f1(z11,,zn1),,fm(z1m,,znm)). f_0(g_1(z_{11},\dots,z_{1m}),\dots,g_n(z_{n1},\dots,z_{nm})) = g_0(f_1(z_{11},\dots,z_{n1}),\dots,f_m(z_{1m},\dots,z_{nm})). Our results generalize work of Dokow and Holzman (2010), which considered the case g0=g1==gng_0 = g_1 = \cdots = g_n, and of Chase, Filmus, Minzer, Mossel and Saurabh (2022), which considered the case g0g1==gng_0 \neq g_1 = \cdots = g_n.

Keywords

Cite

@article{arxiv.2305.10073,
  title  = {Generalized polymorphisms},
  author = {Gilad Chase and Yuval Filmus},
  journal= {arXiv preprint arXiv:2305.10073},
  year   = {2023}
}

Comments

19 pages

R2 v1 2026-06-28T10:36:52.961Z