Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-08T08:26:59.290Z Has data issue: false hasContentIssue false

1 - A First Orientation Session

Published online by Cambridge University Press:  18 December 2009

Anders Björner
Affiliation:
Royal Institute of Technology, Stockholm
Michel Las Vergnas
Affiliation:
Laboratoire de Probabilités, Université Pierre et Marie Curie
Bernd Sturmfels
Affiliation:
University of California, Berkeley
Neil White
Affiliation:
University of Florida
Gunter M. Ziegler
Affiliation:
Technische Universität Berlin
Get access

Summary

Oriented matroids can be thought of as a combinatorial abstraction of point configurations over the reals, of real hyperplane arrangements, of convex polytopes, and of directed graphs. The creators of the theory of oriented matroids have, in fact, drawn their motivation from these diverse mathematical theories (see the historical sketch in Section 3.9), but they have nevertheless arrived at equivalent axiom systems – which manifests the fact that oriented matroids are “the right concept”.

We will start out by illustrating these different aspects of oriented matroids. Doing this, we will present a number of examples while at the same time introducing the main concepts and terminology of oriented matroids. This should assist the reader who wishes to access the later chapters in a non-linear order, or who first wants a quick idea of what is going on. It should also provide intuition and motivation both for the axiomatics and the further development of the theory.

Hence, our first two chapters will avoid an extensive discussion of the axiom systems for oriented matroids, which are treated in Chapter 3. We will also minimize dependence on background from ordinary matroids. Furthermore, extensive attributions will not be given in these introductory chapters; we refer to later chapters and the bibliography.

Oriented matroids from directed graphs

Let us consider the simple cycles of a directed graph D = (V,E) with arc set E, together with an orientation of each such cycle. Then every arc of a cycle is either a forward (positive) arc or a backward (negative) arc in the cycle. This allows us to consider the cycle as a signed subset of E, which consists of a positive and a negative part.

Type
Chapter
Information
Oriented Matroids , pp. 1 - 45
Publisher: Cambridge University Press
Print publication year: 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×