paper

Monophobic Neighborhoods of Cubes

arXiv:2610.14502

Abstract

We define a -cube in a graph to be monophobic in if, whenever it supports a -face of a discrete singular -cube, it must also support another face. In many cases, the presence of such cubes implies the nontriviality of discrete cubical homology and homotopy groups associated with . We describe several large classes of examples and characterize the property completely when .