Format:
X, 158 S.
,
graph. Darst.
ISBN:
0387947345
Series Statement:
Universitext
Content:
This book presents some of the most famous problems of convex and discrete geometry - such as Borsuk's problem (is it possible to partition any bounded set in an n-dimensional Euclidean space into n+1 subsets, each of which is strictly smaller in diameter than the full set?) and the finite sphere-packing problem (how can one arrange m nonoverlapping congruent spheres in an n-dimensional Euclidean space to minimize the volume or surface area of their convex hull?) - as well as their (at times astonishing) answers. Though covering some of the most recent developments in the field, the book is self-contained, and can be understood by any trained mathematician.
Language:
English
Subjects:
Mathematics
Keywords:
Konvexe Geometrie
;
Diskrete Geometrie
;
Lehrbuch
Bookmarklink