Classical topics in discrete geometry by K?roly Bezdek

By K?roly Bezdek

About the writer: Karoly Bezdek acquired his Dr.rer.nat.(1980) and Habilitation (1997) levels in arithmetic from the Eötvös Loránd college, in Budapest and his Candidate of Mathematical Sciences (1985) and health practitioner of Mathematical Sciences (1994) levels from the Hungarian Academy of Sciences. he's the writer of greater than a hundred learn papers and presently he's professor and Canada study Chair of arithmetic on the collage of Calgary. concerning the e-book: This multipurpose publication can function a textbook for a semester lengthy graduate point path giving a quick creation to Discrete Geometry. It can also function a learn monograph that leads the reader to the frontiers of the newest study advancements within the classical center a part of discrete geometry. ultimately, the forty-some chosen study difficulties supply a very good likelihood to take advantage of the ebook as a quick challenge ebook geared toward complex undergraduate and graduate scholars in addition to researchers. The textual content is headquartered round 4 significant and by way of now classical difficulties in discrete geometry. the 1st is the matter of densest sphere packings, which has greater than a hundred years of mathematically wealthy heritage. the second one serious problem is sometimes quoted lower than the nearly 50 years previous illumination conjecture of V. Boltyanski and H. Hadwiger. The 3rd subject is on overlaying by way of planks and cylinders with emphases at the affine invariant model of Tarski's plank challenge, which was once raised via T. Bang greater than 50 years in the past. The fourth subject is situated round the Kneser-Poulsen Conjecture, which is also nearly 50 years previous. All 4 issues witnessed very contemporary leap forward effects, explaining their significant function during this book.

Show description

Read or Download Classical topics in discrete geometry PDF

Similar mathematics books

Introduction to computer performance analysis with Mathematica

"Introduction to computing device functionality research with Mathematica" is designed as a beginner's advisor to laptop functionality research and assumes just a uncomplicated wisdom of desktops and a few mathematical talent. The mathematical elements were relegated to a Mathematica application disk, permitting readers to aim out lots of the thoughts as they paintings their method during the ebook.

Additional resources for Classical topics in discrete geometry

Example text

As is well known 1 ≤ him(K) ≤ d. Using this notion Boltyanski [82] gave a proof of the following theorem. 5 Let K be a convex body with him(K) = 2 in Ed , d ≥ 3. Then I(K) ≤ 2d − 2d−2 . In fact, in [82] Boltyanski conjectures the following more general inequality. 6 Let K be a convex body with him(K) = h > 2 in Ed , d ≥ 3. Then I(K) ≤ 2d − 2d−h . The author and Bisztriczky gave a proof of the Illumination Conjecture for the class of dual cyclic polytopes in [53]. Their upper bound for the illumination numbers of dual cyclic polytopes has been improved by Talata in [240].

Wn in Ed such that their union covers the largest volume subset of C, that is, for which vold ((P1 ∪ P2 ∪ · · · ∪ Pn ) ∩ C) is as large as possible. As the following special case is the most striking form of the above problem, we are putting it forward as the main question of this section. 1 Let Bd denote the unit ball centered at the origin o in Ed . Moreover, let w1 , w2 , . . , wn be positive real numbers satisfying the inequality w1 + w2 + · · · + wn < 2. Then prove or disprove that the union of the planks P1 , P2 , .

3 (i) If K is a centrally symmetric convex body in E3 , then I(K) ≤ 8. (ii) If K is a convex body symmetric about a plane in E3 , then I(K) ≤ 8. Lassak [186] and later also Weissbach [246] and the author, L´angi, Nasz´odi, and Papez [69] gave a proof of the following. 4 The illumination number of any convex body of constant width in E3 is at most 6. It is tempting to conjecture the following even stronger result. If true, then it would give a new proof and insight of the well-known theorem, conjectured by Borsuk long ago (see for example [1]), that any set of diameter 1 in E3 can be partitioned into (at most) four subsets of diameter smaller than 1.

Download PDF sample

Rated 4.06 of 5 – based on 12 votes