Independent sets in the discrete hypercube
classification
🧮 math.CO
keywords
discretehypercubeindependentsetsasymptoticallydescribedimensionalexpository
read the original abstract
In this expository note we describe a proof due to A. Sapozhenko that the number of independent sets in the discrete $d$-dimensional hypercube $Q_d$ is asymptotically $2 \sqrt{e} 2^{2^{d-1}}$ as $d$ tends to infinity.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Range of random $\mathbb Z$-homomorphisms on weak expanders
Random Z-homomorphisms on weak expanders are O(log log n)-flat with high probability, answering a question of Peled-Samotij-Yehudayoff, and at most 5-valued on Hamming-cube middle layers.
-
Counting independent sets in percolated graphs via the Ising model
An asymptotic expansion is derived for the expected number of independent sets in percolated regular bipartite graphs via the Ising model and cluster expansion, extending prior hypercube work.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.