Uniqueness in Harper's vertex-isoperimetric theorem

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…