✦ LIBER ✦

On-line covering the unit cube by cubes

✍ Scribed by J. Januszewski; M. Lassak

Book ID: 110561256
Publisher: Springer
Year: 1994
Tongue: English
Weight: 256 KB
Volume: 12
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02574390

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line covering a cube by a sequence of

On-line covering a cube by a sequence of cubes

✍ W. Kuperberg 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 375 KB

On-Line Packing Sequences of Cubes in th

On-Line Packing Sequences of Cubes in the Unit Cube

✍ JANUSZ Januszewski; MAREK Lassak 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 92 KB

Covering the Cube by Affine Hyperplanes

✍ Noga Alon; Zoltán Füredi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 147 KB

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.

Essential covers of the cube by hyperpla

Essential covers of the cube by hyperplanes

✍ Nathan Linial; Jaikumar Radhakrishnan 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 180 KB

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

Multiple tilings of Euclidean space by u

Multiple tilings of Euclidean space by unit cubes

✍ B. Gordon 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 252 KB