arXiv Analytics

Sign in

arXiv:1310.8179 [math.CO]AbstractReferencesReviewsResources

Almost isoperimetric subsets of the discrete cube

David Ellis

Published 2013-10-30, updated 2013-11-27Version 2

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$ is less than an absolute constant. We deduce that if $A \subset \{0,1\}^{n}$ has size $2^{t}$ for some $t \in \mathbb{N}$, and cannot be made into a subcube by fewer than $\delta |A|$ additions and deletions, then its edge-boundary has size at least $|A| \log_{2}(2^{n}/|A|) + |A| \delta \log_{2}(1/\delta) = 2^{t}(n-t+\delta \log_{2}(1/\delta))$, provided $\delta$ is less than an absolute constant. This is sharp whenever $\delta = 1/2^{j}$ for some $j \in \{1,2,\ldots,t\}$.

Comments: Typos corrected in Conjectures 12 and 13
Journal: Combinatorics, Probability and Computing 20 (2011), 363-380
Categories: math.CO
Subjects: 05D05
Related articles: Most relevant | Search more
arXiv:1609.04270 [math.CO] (Published 2016-09-14)
An isoperimetric inequality for antipodal subsets of the discrete cube
arXiv:2112.09352 [math.CO] (Published 2021-12-17, updated 2023-06-20)
Additive energies on discrete cubes
arXiv:2308.16647 [math.CO] (Published 2023-08-31)
On size Ramsey numbers for a pair of cycles