✦ LIBER ✦

A solution for the coloured cubes problem

✍ Scribed by J.M. Basart; P. Guitart

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 290 KB
Volume: 225
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00335-1

No coin nor oath required. For personal study only.

✦ Synopsis

Let C be any set of q cubes in which every face in each one of them has to be coloured using one colour in a set K of q colours. It is asked how to raise, if it is possible, a pile with the q cubes in such a way that every colour will appear once in every one of the four faces of the pile. The case q = 4 was solved long time ago. Now, an answer is presented for the general case by means of an efficient algorithm. This method is based on a particular linear program which always produces integer solutions.

📜 SIMILAR VOLUMES

A problem for the eternity solution

✍ David Widerker 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 463 KB

Consider the following reductio argument against the compatibility of divine foreknowledge and human freedom: God exists at every moment of time, and is essentially omniscient in the sense that it is logically impossible for him to believe a false proposition, or to fail to believe any true proposi

A solution to a colouring problem of P.

A solution to a colouring problem of P. Erdős

✍ Herbert Fleischner; Michael Stiebitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A new solution for the gauge origin prob

A new solution for the gauge origin problem

✍ Andrzej J. Sadlej 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 480 KB

## Ret&veil 30 Jlme 1975 A variation scheine for the detestation of the optizzd gauge origin in the finite basis set ~cu~tiofls of second-order molecular magnetic properties, is presented. The best gauge origin ir defied in terms of the smallest possibfe violation of the completeness r&lion for a

Algorithm for the solution of a sampling

Algorithm for the solution of a sampling problem

✍ E.A. Kopinskii 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 163 KB

A new solution for Thue's problem

✍ Xiaokang Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 435 KB

On a problem of Yuzvinsky on separating

On a problem of Yuzvinsky on separating the n-cube

✍ D.J. Kleitman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 474 KB

The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.