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.
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● ISBN 9781461384816 ● Utgivare Springer New York ● Publicerad 2012 ● Nedladdningsbara 3 gånger ● Valuta EUR ● ID 4600584 ● Kopieringsskydd Adobe DRM
Kräver en DRM-kapabel e-läsare