One can easily cover the vertices of the \(n\)-cube by 2 hyperplanes. Here it is proved that any set of hyperplanes that covers all the vertices of the \(n\)-cube but one contains at least \(n\) hyperplanes. We give a variety of proofs and generalizations.
β¦ LIBER β¦
Essential covers of the cube by hyperplanes
β Scribed by Nathan Linial; Jaikumar Radhakrishnan
- Book ID
- 108167128
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 180 KB
- Volume
- 109
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Covering the Cube by Affine Hyperplanes
β
Noga Alon; ZoltΓ‘n FΓΌredi
π
Article
π
1993
π
Elsevier Science
π
English
β 147 KB
On-line covering the unit cube by cubes
β
J. Januszewski; M. Lassak
π
Article
π
1994
π
Springer
π
English
β 256 KB
On-line covering a cube by a sequence of
β
W. Kuperberg
π
Article
π
1994
π
Springer
π
English
β 375 KB
Subcube Coverings of Random Spanning Sub
β
Karl Weber
π
Article
π
1985
π
John Wiley and Sons
π
English
β 896 KB
Let G(n, p ) denote the probability space consisting of all spanning subgraphs g of the n-cube En, and the probability is defined as ERDOS and SPENCER investigated the connectedness of such random graphs for fixed probability p , O<p<l (cf. [l]). I n this paper we study coverings of the vertex set
Remarks on the separation of sets by a h
β
V. P. Dol'nikov
π
Article
π
1988
π
Springer
π
English
β 306 KB
Random Spaces Generated by Vertices of t
β
Giannopoulos; Hartzoulaki
π
Article
π
2002
π
Springer
π
English
β 149 KB