Examines in detail those topics in convex geometry that are concerned with Euclidean space Enriched by numerous examples, illustrations, and exercises, with a good bibliography and index Requires only a basic knowledge of geometry, linear algebra, analysis, topology, and measure theory Can be used for graduates courses or seminars in convex geometry, geometric and convex combinatorics, and convex analysis and optimization

Examines in detail those topics in convex geometry that are concerned with Euclidean space Enriched by numerous examples, illustrations, and exercises, with a good bibliography and index Requires only a basic knowledge of geometry, linear algebra, analysis, topology, and measure theory Can be used for graduates courses or seminars in convex geometry, geometric and convex combinatorics, and convex analysis and optimization

Handbook of Convex Geometry, Volume A offers a survey of convex geometry and its many ramifications and relations with other areas of mathematics, including convexity, geometric inequalities, and convex sets. The selection first offers information on the history of convexity, characterizations of convex sets, and mixed volumes. Topics include elementary convexity, equality in the Aleksandrov-Fenchel inequality, mixed surface area measures, characteristic properties of convex sets in analysis and differential geometry, and extensions of the notion of a convex set. The text then reviews the standard isoperimetric theorem and stability of geometric inequalities. The manuscript takes a look at selected affine isoperimetric inequalities, extremum problems for convex discs and polyhedra, and rigidity. Discussions focus on include infinitesimal and static rigidity related to surfaces, isoperimetric problem for convex polyhedral, bounds for the volume of a convex polyhedron, curvature image inequality, Busemann intersection inequality and its relatives, and Petty projection inequality. The book then tackles geometric algorithms, convexity and discrete optimization, mathematical programming and convex geometry, and the combinatorial aspects of convex polytopes. The selection is a valuable source of data for mathematicians and researchers interested in convex geometry.

This book provides a self-contained introduction to convex geometry in Euclidean space. After covering the basic concepts and results, it develops Brunn–Minkowski theory, with an exposition of mixed volumes, the Brunn–Minkowski inequality, and some of its consequences, including the isoperimetric inequality. Further central topics are then treated, such as surface area measures, projection functions, zonoids, and geometric valuations. Finally, an introduction to integral-geometric formulas in Euclidean space is provided. The numerous exercises and the supplementary material at the end of each section form an essential part of the book. Convexity is an elementary and natural concept. It plays a key role in many mathematical fields, including functional analysis, optimization, probability theory, and stochastic geometry. Paving the way to the more advanced and specialized literature, the material will be accessible to students in the third year and can be covered in one semester.

Handbook of Convex Geometry, Volume B offers a survey of convex geometry and its many ramifications and connections with other fields of mathematics, including convexity, lattices, crystallography, and convex functions. The selection first offers information on the geometry of numbers, lattice points, and packing and covering with convex sets. Discussions focus on packing in non-Euclidean spaces, problems in the Euclidean plane, general convex bodies, computational complexity of lattice point problem, centrally symmetric convex bodies, reduction theory, and lattices and the space of lattices. The text then examines finite packing and covering and tilings, including plane tilings, monohedral tilings, bin packing, and sausage problems. The manuscript takes a look at valuations and dissections, geometric crystallography, convexity and differential geometry, and convex functions. Topics include differentiability, inequalities, uniqueness theorems for convex hypersurfaces, mixed discriminants and mixed volumes, differential geometric characterization of convexity, reduction of quadratic forms, and finite groups of symmetry operations. The selection is a dependable source of data for mathematicians and researchers interested in convex geometry.

Convex and Discrete Geometry is an area of mathematics situated between analysis, geometry and discrete mathematics with numerous relations to other subdisciplines. This book provides a comprehensive overview of major results, methods and ideas of convex and discrete geometry and its applications. Besides being a graduate-level introduction to the field, it is a practical source of information and orientation for convex geometers, and useful to people working in the applied fields.

Handbook of Convex Geometry, Volume A offers a survey of convex geometry and its many ramifications and relations with other areas of mathematics, including convexity, geometric inequalities, and convex sets. The selection first offers information on the history of convexity, characterizations of convex sets, and mixed volumes. Topics include elementary convexity, equality in the Aleksandrov-Fenchel inequality, mixed surface area measures, characteristic properties of convex sets in analysis and differential geometry, and extensions of the notion of a convex set. The text then reviews the standard isoperimetric theorem and stability of geometric inequalities. The manuscript takes a look at selected affine isoperimetric inequalities, extremum problems for convex discs and polyhedra, and rigidity. Discussions focus on include infinitesimal and static rigidity related to surfaces, isoperimetric problem for convex polyhedral, bounds for the volume of a convex polyhedron, curvature image inequality, Busemann intersection inequality and its relatives, and Petty projection inequality. The book then tackles geometric algorithms, convexity and discrete optimization, mathematical programming and convex geometry, and the combinatorial aspects of convex polytopes. The selection is a valuable source of data for mathematicians and researchers interested in convex geometry.