Uniqueness in Harper's vertex-isoperimetric theorem
Eero Raty

TL;DR
This paper investigates the uniqueness of subsets in the hypercube that minimize neighborhood sizes, providing counterexamples to a conjecture and classifying all such extremal sets.
Contribution
It offers the first counterexample to a conjecture about minimal neighborhoods, classifies all extremal sets, and links minimal neighborhood sizes for different t.
Findings
Counterexamples to the conjecture are provided.
Sets with minimal neighborhoods are classified.
Minimal neighborhood properties for A and A^c are equivalent.
Abstract
For a set the -neighbourhood of is , where denotes the usual graph distance on . Harper's vertex-isoperimetric theorem states that among the subsets of given size, the size of the -neighbourhood is minimised when is taken to be an initial segment of the simplicial order. Aubrun and Szarek asked the following question: if is a subset of given size for which the sizes of both and are minimal for all , does it follow that is isomorphic to an initial segment of the simplicial order? Our aim is to give a counterexample. Surprisingly it turns out that there is no counterexample that is a Hamming ball, meaning a set that lies between two consecutive exact Hamming…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
