paper

On a biased edge isoperimetric inequality for the discrete cube

arXiv:1702.01675

Abstract

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary of a set , as a function of . A weaker (but more widely-used) lower bound is , where equality holds iff is a subcube. In 2011, the first author obtained a sharp `stability' version of the latter result, proving that if , then there exists a subcube such that . The `weak' version of the edge isoperimetric inequality has the following well-known generalization for the `-biased' measure on the discrete cube: if , or if and is monotone increasing, then . In this paper, we prove a sharp stability version of the latter result, which generalizes the aforementioned result of the first author. Namely, we prove that if , then there exists a subcube such that , where . This result is a central component in recent work of the authors proving sharp stability versions of a number of Erdős-Ko-Rado type theorems in extremal combinatorics, including the seminal `complete intersection theorem' of Ahlswede and Khachatrian. In addition, we prove a biased-measure analogue of the `full' edge isoperimetric inequality, for monotone increasing sets, and we observe that such an analogue does not hold for arbitrary sets, hence answering a question of Kalai. We use this result to give a new proof of the `full' edge isoperimetric inequality, one relying on the Kruskal-Katona theorem.

36 pages. More explanations added, and minor corrections made, in response to referee comments