English

Uniqueness in Harper's vertex-isoperimetric theorem

Combinatorics 2019-10-24 v2

Abstract

For a set AQn={0,1}nA\subseteq Q_{n}=\left\{ 0,1\right\} ^{n} the tt-neighbourhood of AA is Nt(A)={x:d(x,A)t}N^{t}\left(A\right)=\left\{ x\,:\,d\left(x,A\right)\leq t\right\}, where dd denotes the usual graph distance on QnQ_{n}. Harper's vertex-isoperimetric theorem states that among the subsets AQnA\subseteq Q_{n} of given size, the size of the tt-neighbourhood is minimised when AA is taken to be an initial segment of the simplicial order. Aubrun and Szarek asked the following question: if AQnA\subseteq Q_{n} is a subset of given size for which the sizes of both Nt(A)N^{t}\left(A\right) and Nt(Ac)N^{t}\left(A^{c}\right) are minimal for all t>0t>0, does it follow that AA 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 AA with B(x,r)AB(x,r+1)B\left(x,r\right)\subseteq A\subseteq B\left(x,r+1\right) for some xQnx\in Q_{n}. We go further to classify all the sets AQnA\subseteq Q_{n} for which the sizes of both Nt(A)N^{t}\left(A\right) and Nt(Ac)N^{t}\left(A^{c}\right) are minimal for all t>0t>0 among the subsets of QnQ_{n} of given size. We also prove that, perhaps surprisingly, if AQnA\subseteq Q_{n} for which the sizes of N(A)N\left(A\right) and N(Ac)N\left(A^{c}\right) are minimal among the subsets of QnQ_{n} of given size, then the sizes of both Nt(A)N^{t}\left(A\right) and Nt(Ac)N^{t}\left(A^{c}\right) are also minimal for all t>0t>0 among the subsets of QnQ_{n} of given size. Hence the same classification also holds when we only require N(A)N\left(A\right) and N(Ac)N\left(A^{c}\right) to have minimal size among the subsets AQnA\subseteq Q_{n} of given size.

Keywords

Cite

@article{arxiv.1806.11061,
  title  = {Uniqueness in Harper's vertex-isoperimetric theorem},
  author = {Eero Raty},
  journal= {arXiv preprint arXiv:1806.11061},
  year   = {2019}
}
R2 v1 2026-06-23T02:45:04.728Z