Computational Geometry of Positive Definite Quadratic Forms - Polyhedral Reduction Theories, Algorithms, and Applications (Paperback, New ed.)

Starting from classical arithmetical questions on quadratic forms, this book takes the reader step by step through the connections with lattice sphere packing and covering problems. As a model for polyhedral reduction theories of positive definite quadratic forms, Minkowski's classical theory is presented, including an application to multidimensional continued fraction expansions. The reduction theories of Voronoi are described in great detail, including full proofs, new views, and generalizations that cannot be found elsewhere. Based on Voronoi's second reduction theory, the local analysis of sphere coverings and several of its applications are presented. These include the classification of totally real thin number fields, connections to the Minkowski conjecture, and the discovery of new, sometimes surprising, properties of exceptional structures such as the Leech lattice or the root lattices. Throughout this book, special attention is paid to algorithms and computability, allowing computer-assisted treatments. Although dealing with relatively classical topics that have been worked on extensively by numerous authors, this book is exemplary in showing how computers may help to gain new insights.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	University Lecture Series
Release date:	2009
Format:	Paperback
Pages:	147
Edition:	New ed.
ISBN-13:	978-0-8218-4735-0
Categories:	Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry Books > Science & Mathematics > Mathematics > Topology > General Promotions
LSN:	0-8218-4735-X
Barcode:	9780821847350

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!