UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

The unrestricted blocking number in convex geometry

Sezgin, S.; (2010) The unrestricted blocking number in convex geometry. Doctoral thesis, UCL (University College London). Green open access

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1271Kb

Abstract

Let K be a convex body in \mathbb{R}^n. We say that a set of translates \left \{ K + \underline{u}_i \right \}_{i=1}^{p} block K if any other translate of K which touches K, overlaps one of K + \underline{u}_i, i = 1, . . . , p. The smallest number of non-overlapping translates (i.e. whose interiors are disjoint) of K, all of which touch K at its boundary and which block any other translate of K from touching K is called the Blocking Number of K and denote it by B(K). This thesis explores the properties of the blocking number in general but the main purpose is to study the unrestricted blocking number B_\alpha(K), i.e., when K is blocked by translates of \alpha K, where \alpha is a fixed positive number and when the restrictions that the translates are non-overlapping or touch K are removed. We call this number the Unrestricted Blocking Number and denote it by B_\alpha(K). The original motivation for blocking number is the following famous problem: Can a rigid material sphere be brought into contact with 13 other such spheres of the same size? This problem was posed by Kepler in 1611. Although this problem was raised by Kepler, it is named after Newton since Newton and Gregory had a dispute over the solution which was eventually settled in Newton’s favour. It is called the Newton Number, N(K) of K and is defined to be the maximum number of non-overlapping translates of K which can touch K at its boundary. The well-known dispute between Sir Isaac Newton and David Gregory concerning this problem, which Newton conjectured to be 12, and Gregory thought to be 13, was ended 180 years later. In 1874, the problem was solved by Hoppe in favour of Newton, i.e., N(\beta^3) = 12. In his proof, the arrangement of 12 unit balls is not unique. This is thought to explain why the problem took 180 years to solve although it is a very natural and a very simple sounding problem. As a generalization of the Newton Number to other convex bodies the blocking number was introduced by C. Zong in 1993. “Another characteristic of mathematical thought is that it can have no success where it cannot generalize.” C. S. Pierce As quoted above, in mathematics generalizations play a very important part. In this thesis we generalize the blocking number to the Unrestricted Blocking Number. Furthermore; we also define the Blocking Number with negative copies and denote it by B_(K). The blocking number not only gives rise to a wide variety of generalizations but also it has interesting observations in nature. For instance, there is a direct relation to the distribution of holes on the surface of pollen grains with the unrestricted blocking number.

Type:Thesis (Doctoral)
Title:The unrestricted blocking number in convex geometry
Open access status:An open access version is available from UCL Discovery
Language:English
Additional information:The abstract contains LaTeX text. Please see the attached pdf for rendered expressions
UCL classification:UCL > School of BEAMS > Faculty of Maths and Physical Sciences > Mathematics

View download statistics for this item

Archive Staff Only: edit this record