Counting and Covering in Nearest-Neighbour Representations of Boolean Functions

@misc{anthony2026counting,
  title = {{Counting and Covering in Nearest-Neighbour Representations of Boolean Functions}},
  author = {Martin Anthony},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.23094},
  eprint = {2609.23094},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.23094},
}

TY  - UNPB
TI  - Counting and Covering in Nearest-Neighbour Representations of Boolean Functions
AU  - Martin Anthony
PY  - 2026
DA  - 2026/09/19
PB  - arXiv
DO  - 10.48550/arxiv.2609.23094
UR  - https://arxiv.org/abs/2609.23094
AB  - We study the number of prototypes needed to represent Boolean functions by nearest-neighbour classification. There are two distinct settings: the prototypes may be arbitrary points of Euclidean space, or they may themselves be required to lie in the Boolean cube. For unrestricted prototypes, we strengthen a known lower bound for almost all Boolean functions. The bound applies simultaneously to nearest-neighbour voting rules with any number of voting neighbours, and substantially narrows the gap with the known general upper bound. We obtain a VC-dimension bound for classes with a bounded number of prototypes, and show that it is sharp in order in dimensions at least four. We then study Boolean prototypes, beginning with symmetric threshold functions. A connection with covering designs expresses the minimum number of prototypes at every threshold level exactly in terms of a covering number, and leads to further exact results for related monotone functions, including disjunctive extensions and a characterisation of when a representation with a single negative prototype is possible. For a uniformly random Boolean function, the Boolean nearest-neighbour complexity, as a proportion of the cube, is asymptotically close either to one half or to one, with explicit limiting probabilities. In particular, almost every Boolean function requires at least approximately half as many prototypes as there are points in the cube, and one half is the largest proportion for which such a lower bound holds. Finally, we consider arbitrary symmetric Boolean functions. Their Boolean nearest-neighbour complexity is closely approximated by a weighted vertex-cover problem on paths. As a consequence, a uniformly random symmetric function typically requires prototypes amounting to 11/20 of the cube. This is much larger than the upper bounds known when the prototypes are allowed to lie anywhere in Euclidean space.
ER  -