Indistinguishable sceneries on the Boolean hypercube

Abstract

We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a constant fraction of neighbors colored by $1$, and locally stable functions, in which every vertex has a constant fraction of neighbors colored by its own color. Our methods are constructive, and also give super-polynomial lower bounds on the number of locally biased and locally stable functions. We further show similar results for ${\mathbb{Z}}^n$ and other graphs, and offer several follow-up questions.

References in corpus (2)

• On the number of 1-perfect binary codes: a lower bound
• Scenery Reconstruction on Finite Abelian Groups

Cited by in corpus (2)

• The Number of Locally $p$-stable Functions on $Q_n$
• Biased partitions of ${\mathbb{Z}}^n$