Author : Jiri Matousek
Publisher : Springer Science & Business Media
Page : 491 pages
File Size : 30,41 MB
Release : 2013-12-01
Category : Mathematics
ISBN : 1461300398
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
Author : Ji?í Matoušek
Publisher : Springer
Page : 486 pages
File Size : 36,69 MB
Release : 2002-05-02
Category : Mathematics
ISBN : 9780387953748
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
Author : Günter M. Ziegler
Publisher : Springer Science & Business Media
Page : 388 pages
File Size : 38,3 MB
Release : 2012-05-03
Category : Mathematics
ISBN : 038794365X
Based on a graduate course at the Technische Universität, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The straightforward exposition features many illustrations, and complete proofs for most theorems. With only linear algebra as a prerequisite, it takes the reader quickly from the basics to topics of recent research. The lectures introduce basic facts about polytopes, with an emphasis on methods that yield the results, discuss important examples and elegant constructions, and show the excitement of current work in the field. They will provide interesting and enjoyable reading for researchers as well as students.
Author : Daniel Hug
Publisher : Springer Nature
Page : 287 pages
File Size : 24,91 MB
Release : 2020-08-27
Category : Mathematics
ISBN : 3030501809
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.
Author : Rekha R. Thomas
Publisher : American Mathematical Soc.
Page : 156 pages
File Size : 36,83 MB
Release : 2006
Category : Mathematics
ISBN : 9780821841402
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for an advanced undergraduate or beginning graduate student. The book starts with the basics of polytope theory. Schlegel and Gale diagrams are introduced as geometric tools to visualize polytopes in high dimension and to unearth bizarre phenomena in polytopes. The heart of the book is a treatment of the secondary polytope of a point configuration and its connections to the statepolytope of the toric ideal defined by the configuration. These polytopes are relatively recent constructs with numerous connections to discrete geometry, classical algebraic geometry, symplectic geometry, and combinatorics. The connections rely on Grobner bases of toric ideals and other methods fromcommutative algebra. The book is self-contained and does not require any background beyond basic linear algebra. With numerous figures and exercises, it can be used as a textbook for courses on geometric, combinatorial, and computational aspects of the theory of polytopes.
Author : Matthias Beck
Publisher : Springer
Page : 295 pages
File Size : 50,90 MB
Release : 2015-11-14
Category : Mathematics
ISBN : 1493929690
This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart’s theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler–Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: “You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.” — MAA Reviews “The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography.” — Zentralblatt MATH “This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.” — Mathematical Reviews “Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course.” — CHOICE
Author : American Mathematical Society. Short Course, Discrete Differential Geometry
Publisher : American Mathematical Soc.
Page : 140 pages
File Size : 27,23 MB
Release : 2020-09-02
Category : Education
ISBN : 1470446626
Discrete Differential Geometry (DDG) is an emerging discipline at the boundary between mathematics and computer science. It aims to translate concepts from classical differential geometry into a language that is purely finite and discrete, and can hence be used by algorithms to reason about geometric data. In contrast to standard numerical approximation, the central philosophy of DDG is to faithfully and exactly preserve key invariants of geometric objects at the discrete level. This process of translation from smooth to discrete helps to both illuminate the fundamental meaning behind geometric ideas and provide useful algorithmic guarantees. This volume is based on lectures delivered at the 2018 AMS Short Course ``Discrete Differential Geometry,'' held January 8-9, 2018, in San Diego, California. The papers in this volume illustrate the principles of DDG via several recent topics: discrete nets, discrete differential operators, discrete mappings, discrete conformal geometry, and discrete optimal transport.
Author : Chuanming Zong
Publisher : Cambridge University Press
Page : 196 pages
File Size : 19,26 MB
Release : 2006-02-02
Category : Mathematics
ISBN : 9780521855358
Analysis, Algebra, Combinatorics, Graph Theory, Hyperbolic Geometry, Number Theory.
Author : Jiri Matousek
Publisher : Springer Science & Business Media
Page : 221 pages
File Size : 27,32 MB
Release : 2008-01-12
Category : Mathematics
ISBN : 3540766499
To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. This brilliant exposition goes back to basics to explain how the subject has been used to further our understanding in some key areas. A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. This book is the first textbook treatment of a significant part of these results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.
Author : Ya. B. Pesin
Publisher : American Mathematical Soc.
Page : 334 pages
File Size : 18,83 MB
Release : 2009
Category : Mathematics
ISBN : 0821848895
Both fractal geometry and dynamical systems have a long history of development and have provided fertile ground for many great mathematicians and much deep and important mathematics. These two areas interact with each other and with the theory of chaos in a fundamental way: many dynamical systems (even some very simple ones) produce fractal sets, which are in turn a source of irregular 'chaotic' motions in the system. This book is an introduction to these two fields, with an emphasis on the relationship between them. The first half of the book introduces some of the key ideas in fractal geometry and dimension theory - Cantor sets, Hausdorff dimension, box dimension - using dynamical notions whenever possible, particularly one-dimensional Markov maps and symbolic dynamics. Various techniques for computing Hausdorff dimension are shown, leading to a discussion of Bernoulli and Markov measures and of the relationship between dimension, entropy, and Lyapunov exponents. In the second half of the book some examples of dynamical systems are considered and various phenomena of chaotic behaviour are discussed, including bifurcations, hyperbolicity, attractors, horseshoes, and intermittent and persistent chaos. These phenomena are naturally revealed in the course of our study of two real models from science - the FitzHugh - Nagumo model and the Lorenz system of differential equations. This book is accessible to undergraduate students and requires only standard knowledge in calculus, linear algebra, and differential equations. Elements of point set topology and measure theory are introduced as needed. This book is a result of the MASS course in analysis at Penn State University in the fall semester of 2008.
