𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering the Cube by Affine Hyperplanes

✍ Scribed by Noga Alon; Zoltán Füredi

Book ID
102570370
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
147 KB
Volume
14
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Covering Cubes by Random Half Cubes, wit
Covering Cubes by Random Half Cubes, with Applications to Binary Neural Networks
✍ Jeong Han Kim; James R. Roche 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Let Q n be the (hyper)cube [&1, 1] n . This paper is concerned with the following question: How many vectors must be chosen uniformly and independently at random from Q n before every vector in Q n itself has negative inner product with at least one of the random vectors? For any fixed =>0, a simple

Intersections by hyperplanes
Intersections by hyperplanes
✍ M. Edelstein 📂 Article 📅 1969 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 230 KB