English

On the structure of subsets of the discrete cube with small edge boundary

Combinatorics 2018-05-28 v4

Abstract

The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers mm and nn, the minimum size gn(m)g_n(m) of the edge boundary of an mm-element subset of {0,1}n\{0,1\}^{n}; the extremal families (up to automorphisms of the discrete cube) are initial segments of the lexicographic ordering on {0,1}n\{0,1\}^n. We show that for any mm-element subset F{0,1}n\mathcal{F} \subset \{0,1\}^n and any integer ll, if the edge boundary of F\mathcal{F} has size at most gn(m)+lg_n(m)+l, then there exists an extremal family G{0,1}n\mathcal{G} \subset \{0,1\}^n such that FΔGCl|\mathcal{F} \Delta \mathcal{G}| \leq Cl, where CC is an absolute constant. This is best-possible, up to the value of CC. Our result can be seen as a `stability' version of the edge isoperimetric inequality in the discrete cube, and as a discrete analogue of the seminal stability result of Fusco, Maggi and Pratelli concerning the isoperimetric inequality in Euclidean space.

Keywords

Cite

@article{arxiv.1612.06680,
  title  = {On the structure of subsets of the discrete cube with small edge boundary},
  author = {David Ellis and Nathan Keller and Noam Lifshitz},
  journal= {arXiv preprint arXiv:1612.06680},
  year   = {2018}
}

Comments

29 pages. Reformatted for publication in Discrete Analysis