Thermodynamic databases for pure substances

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

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

Problem

In 1932 Karol Borsuk showed 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 Template:Nobr 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:

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

Translation:

The following question remains open: Can every bounded subset E of the space ${\mathbb {R}}^{n}$ be partitioned into (n + 1) sets, each of which has a smaller diameter than E?

The question got a positive answer in the following cases:

• d = 2 — the original result by Borsuk (1932).
• d = 3 — the result of Julian Perkal (1947), and independently, 8 years later, 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. Their construction shows that Template:Nobr pieces do not suffice for Template:Nobr and for each Template:Nobr.

After Andriy V. Bondarenko has shown that Borsuk’s conjecture is false for all Template:Nobr, the current best bound, due to Thomas Jenrich, is 64.

Apart from finding the minimum number d of dimensions such that the number of pieces $\alpha (d)>d+1$ mathematicians are interested in finding the general behavior of $\alpha (d)$ function. Kahn and Kalai show that in general (that is for d big enough), one needs $\alpha (d)\geq (1.2)^{\sqrt {d}}$ number of pieces. They also quote the upper bound by Oded Schramm, who showed that for every ε, if d is sufficiently large, $\alpha (d)\leq \left({\sqrt {3/2}}+\varepsilon \right)^{d}$. The correct order of magnitude of α(d) is still unknown (see e.g. Alon's article), however it is conjectured that there is a constant Template:Nobr such that $\alpha (d)>c^{d}$ for all Template:Nobr.

See also

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

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

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.
• Oded Schramm, Illuminating sets of constant width, Mathematika 35 (1988), 180–199.

Further reading

• Oleg Pikhurko, Algebraic Methods in Combinatorics, course notes.

External links

• 
  
  I had like 17 domains hosted on single account, and never had any special troubles. If you are not happy with the service you will get your money back with in 45 days, that's guaranteed. But the Search Engine utility inside the Hostgator account furnished an instant score for my launched website. Fantastico is unable to install WordPress in a directory which already have any file i.e to install WordPress using Fantastico the destination directory must be empty and it should not have any previous installation files. When you share great information, others will take note. Once your hosting is purchased, you will need to setup your domain name to point to your hosting. Money Back: All accounts of Hostgator come with a 45 day money back guarantee. If you have any queries relating to where by and how to use Hostgator Discount Coupon, you can make contact with us at our site. If you are starting up a website or don't have too much website traffic coming your way, a shared plan is more than enough. Condition you want to take advantage of the worldwide web you prerequisite a HostGator web page, -1 of the most trusted and unfailing web suppliers on the world wide web today. Since, single server is shared by 700 to 800 websites, you cannot expect much speed.
  
  
  
  Hostgator tutorials on how to install Wordpress need not be complicated, especially when you will be dealing with a web hosting service that is friendly for novice webmasters and a blogging platform that is as intuitive as riding a bike. After that you can get Hostgator to host your domain and use the wordpress to do the blogging. Once you start site flipping, trust me you will not be able to stop. I cut my webmaster teeth on Control Panel many years ago, but since had left for other hosting companies with more commercial (cough, cough) interfaces. If you don't like it, you can chalk it up to experience and go on. First, find a good starter template design. When I signed up, I did a search for current "HostGator codes" on the web, which enabled me to receive a one-word entry for a discount. Your posts, comments, and pictures will all be imported into your new WordPress blog.