- We will send in 10–14 business days.
/images/books/14897723/9781009494113.jpg)
- Author: Laura Anderson
- Publisher: Cambridge University Press
- ISBN-10: 1009494112
- ISBN-13: 9781009494113
- Format: 15.2 x 22.9 x 1.9 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Oriented matroids appear throughout discrete geometry, with applications in algebra, topology, physics, and data analysis. This introduction to oriented matroids is intended for graduate students, scientists wanting to apply oriented matroids, and researchers in pure mathematics. The presentation is geometrically motivated and largely self-contained, and no knowledge of matroid theory is assumed. Beginning with geometric motivation grounded in linear algebra, the first chapters prove the major cryptomorphisms and the Topological Representation Theorem. From there the book uses basic topology to go directly from geometric intuition to rigorous discussion, avoiding the need for wider background knowledge. Topics include strong and weak maps, localizations and extensions, the Euclidean property and non-Euclidean properties, the Universality Theorem, convex polytopes, and triangulations. Themes that run throughout include the interplay between combinatorics, geometry, and topology, and the idea of oriented matroids as analogs to vector spaces over the real numbers and how this analogy plays out topologically.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.01:24:40
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Laura Anderson
- Publisher: Cambridge University Press
- ISBN-10: 1009494112
- ISBN-13: 9781009494113
- Format: 15.2 x 22.9 x 1.9 cm, hardcover
- Language: English English
Oriented matroids appear throughout discrete geometry, with applications in algebra, topology, physics, and data analysis. This introduction to oriented matroids is intended for graduate students, scientists wanting to apply oriented matroids, and researchers in pure mathematics. The presentation is geometrically motivated and largely self-contained, and no knowledge of matroid theory is assumed. Beginning with geometric motivation grounded in linear algebra, the first chapters prove the major cryptomorphisms and the Topological Representation Theorem. From there the book uses basic topology to go directly from geometric intuition to rigorous discussion, avoiding the need for wider background knowledge. Topics include strong and weak maps, localizations and extensions, the Euclidean property and non-Euclidean properties, the Universality Theorem, convex polytopes, and triangulations. Themes that run throughout include the interplay between combinatorics, geometry, and topology, and the idea of oriented matroids as analogs to vector spaces over the real numbers and how this analogy plays out topologically.
Reviews