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.
Compre este e-book e ganhe mais 1 GRÁTIS!
Língua Inglês ● Formato PDF ● ISBN 9781461384816 ● Editora Springer New York ● Publicado 2012 ● Carregável 3 vezes ● Moeda EUR ● ID 4600584 ● Proteção contra cópia Adobe DRM
Requer um leitor de ebook capaz de DRM