Kategoria BISAC: Mathematics >> Geometry - Analytic

Traditionally, Lorentzian geometry has been used as a necessary tool to understand general relativity, as well as to explore new genuine geometric behaviors, far from classical Riemannian techniques. Recent progress has attracted a renewed interest in this theory for many researchers: long-standing global open problems have been solved, outstanding Lorentzian spaces and groups have been classified, new applications to mathematical relativity and high energy physics have been found, and further connections with other geometries have been developed.

Samples of these fresh...

​Optimization has long been a source of both inspiration and applications for geometers, and conversely, discrete and convex geometry have provided the foundations for many optimization techniques, leading to a rich interplay between these subjects. The purpose of the Workshop on Discrete Geometry, the Conference on Discrete Geometry and Optimization, and the Workshop on Optimization, held in September 2011 at the Fields Institute, Toronto, was to further stimulate the interaction between geometers and optimizers. This volume reflects the interplay between these areas.

The...

This monograph gives a short introduction to the relevant modern parts of discrete geometry, in addition to leading the reader to the frontiers of geometric research on sphere arrangements. The readership is aimed at advanced undergraduate and early graduate students, as well as interested researchers. It contains more than 40 open research problems ideal for graduate students and researchers in mathematics and computer science. Additionally, this book may be considered ideal for a one-semester advanced undergraduate or graduate level course.

The core part of this book is...

Riemannian Geometry is an expanded edition of a highly acclaimed and successful textbook (originally published in Portuguese) for first-year graduate students in mathematics and physics. The author's treatment goes very directly to the basic language of Riemannian geometry and immediately presents some of its most fundamental theorems. It is elementary, assuming only a modest background from readers, making it suitable for a wide variety of students and course structures. Its selection of topics has been deemed "superb" by teachers who have used the text.

A significant...

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry.

The first part of the book studies classical problems and techniques that refer to polyhedral structures. The authors include a study on algorithms for computing convex hulls as well as the construction of Voronoi diagrams and Delone triangulations.

The second part of the book develops the primary concepts of (non-linear)...