Uniqueness in Harper's vertex-isoperimetric theorem
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 balls, i.e.\ a set with for some . We go further to classify all the sets for which the sizes of both and are minimal for all among the subsets of of given size. We also prove that, perhaps surprisingly, if for which the sizes of and are minimal among the subsets of of given size, then the sizes of both and are also minimal for all among the subsets of of given size. Hence the same classification also holds when we only require and to have minimal size among the subsets of given size.
Cite
@article{arxiv.1806.11061,
title = {Uniqueness in Harper's vertex-isoperimetric theorem},
author = {Eero Raty},
journal= {arXiv preprint arXiv:1806.11061},
year = {2019}
}