An example of a hexagon cut into three pieces of smaller diameter.

The Borsuk problem in geometry, for historical reasons incorrectly called a Borsuk conjecture, is a question in discrete geometry.

[edit] Problem

In 1932 Karol Borsuk has shown^[1] that an ordinary 3-dimensional ball in Euclidean space can be easily dissected into 4 solids, each of which has a smaller diameter than the ball, and generally d-dimensional ball can be covered with d + 1 compact sets of diameters smaller than the ball. At the same time he proved that d subsets are not enough in general. The proof is based on the Borsuk–Ulam theorem. That led Borsuk to a general question:

Can every convex body in R^d be cut into (d + 1) pieces of smaller diameter?

The question got a positive answer in the following cases:

• d = 2 — the original result by Borsuk (1932).
• d = 3 — the result of H. G. Eggleston (1955). A simple proof was found later by Branko Grünbaum and Aladár Heppes.
• For all d for the smooth convex bodies — the result of Hugo Hadwiger (1946).
• For all d for centrally-symmetric bodies (A.S. Riesling, 1971).
• For all d for bodies of revolution — the result of Boris Dekster (1995).

The problem was finally solved in 1993 by Jeff Kahn and Gil Kalai, who showed the general answer to the Borsuk's question is NO. The current best bound, due to Aicke Hinrichs and Christian Richter, shows that the answer is negative for all d ≥ 298. The proof by Kahn and Kalai implies that for large enough d, one needs number of pieces. It is conjectured (see e.g. Alon's article) that α(d) > c^d for some c > 1.

[edit] Conjecture status

For many years most of mathematicians expected the general answer to the Borsuk's question would eventually turn out to be "yes", so they called the problem a conjecture and expressed it in a proposition form:

Every convex body in can be cut into d + 1 pieces of smaller diameter.

Borsuk himself, however, was not so sure about it and never expressed the problem in that form. He had enough intuition to leave it just in the question form:

Die folgende Frage bleibt offen: Lässt sich jede beschränkte Teilmenge E des Raumes in (n + 1) Mengen zerlegen, von denen jede einen kleineren Durchmesser als E hat?^[1]

Translation:

The following question remains open: Can every bounded subset E of the space be partitioned into (n + 1) sets, each of which having a smaller diameter than E?

[edit] See also

• Hadwiger's conjecture on covering convex bodies with smaller copies of themselves

[edit] Notes

[edit] References

• Drei Sätze über die n-dimensionale euklidische Sphäre (German 'Three statements of n-dimensional Euclidean sphere') – original Borsuk's article in Fundamenta Mathematicae, made available by Polish Virtual Library of Science

• Jeff Kahn and Gil Kalai, A counterexample to Borsuk's conjecture, Bulletin of the American Mathematical Society 29 (1993), 60–62.
• Noga Alon, Discrete mathematics: methods and challenges, Proceedings of the International Congress of Mathematicians, Beijing 2002, vol. 1, 119–135.
• Aicke Hinrichs and Christian Richter, New sets with large Borsuk numbers, Discrete Math. 270 (2003), 137–147
• Andrei M. Raigorodskii, The Borsuk partition problem: the seventieth anniversary, Mathematical Intelligencer 26 (2004), no. 3, 4–12.
• Oleg Pikhurko, Algebraic Methods in Combinatorics, course notes.

[edit] External links

• Borsuk's Conjecture, from MathWorld.