Universitext

Zong, Chuanming

Convex and discrete geometry is one of the most intuitive subjects in mathematics. One can explain many of its problems, even the most difficult - such as the sphere-packing problem (what is the densest possible arrangement of spheres in an n-dimensional space?) and the Borsuk problem (is it possible to partition any bounded set in an n-dimensional space into n+1 subsets, each of which is strictly smaller in "extent" than the full set?) - in terms that a layman can understand; and one can reasonably make conjectures about their solutions with little training in mathematics.

Details

Published by: Springer

Publication Date: 1996-06-25

Format: Paperback

ISBN-13: 9780387947341

DOI: 10.1007/978-1-4613-8481-6

Dimensions: 235cm x155cm

Pages: 158