Author: Anders Björner

Publisher: Cambridge University Press

ISBN: 9780521777506

Category: Mathematics

Page: 548

View: 2422

Skip to content
# Nothing Found

### Oriented Matroids

First comprehensive, accessible account; second edition has expanded bibliography and a new appendix surveying recent research.

### Computational Oriented Matroids

Oriented matroids play the role of matrices in discrete geometry, when metrical properties, such as angles or distances, are neither required nor available. Thus they are of great use in such areas as graph theory, combinatorial optimization and convex geometry. The variety of applications corresponds to the variety of ways they can be defined. Each of these definitions corresponds to a differing data structure for an oriented matroid, and handling them requires computational support, best realised through a functional language. Haskell is used here, and, for the benefit of readers, the book includes a primer on it. The combination of concrete applications and computation, the profusion of illustrations, many in colour, and the large number of examples and exercises make this an ideal introductory text on the subject. It will also be valuable for self-study for mathematicians and computer scientists working in discrete and computational geometry.

### Pattern Recognition on Oriented Matroids

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities – the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon. The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs. Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn–Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs

### Linear Programming Duality

### Face lattices of oriented matroids

### Triangulations of Oriented Matroids

We consider the concept of triangulation of an oriented matroid. We provide a definition which generalizes the previous ones by Billera-Munson and by Anderson and which specializes to the usual notion of triangulation (or simplicial fan) in the realizable case. Then we study the relation existing between triangulations of an oriented matroid $\mathcal{M}$ and extensions of its dual $\mathcal{M}^*$, via the so-called lifting triangulations. We show that this duality behaves particularly well in the class of Lawrence matroid polytopes. In particular, that the extension space conjecture for realizable oriented matroids is equivalent to the restriction to Lawrence polytopes of the Generalized Baues problem for subdivisions of polytopes. We finish by showing examples and a characterization of lifting triangulations.

### Positive definiteness and eigenvalues in oriented matroids

### Oriented matroids and the linear complementarity problem

### Mathematical Software - ICMS 2006

This volume contains the outstanding collection of invited papers and refereed papers selected for the Second International Congress on Mathematical Software, ICMS 2006, held in Castro Urdiales, Spain, September 1-3, 2006. We cordially invite you to visit the ICMS 2006 website http://www.icms2006.unican.es where you can find all relevant information about this interesting event. ICMS 2006 was the second edition of this congress, which follows up the successful ICMS 2002 held in Beijing, China. Since its inception, this congress has been a satellite event of the International Congress of Mathematicians - ICM, the world’s largest conference on mathematics, celebrated every four years since the edition of 1900 in Paris, where David Hilbert presented his 23 famous problems. For the first time, this 2006 edition of ICM is held in Spain (see: http://www.icm2006.org for details), and so is ICMS 2006. This congress was devoted to all aspects of mathematical software, whose appearance is — in our opinion — one of the most important events in mathematics. Mathematical software systems are used to construct examples, to prove theorems, and to find new mathematical phenomena. Conversely, mathematical research often motivates developments of new algorithms and new systems. Beyond mathematics, mathematical software systems are becoming indispensable tools in many branches of science and technology.

### Tilings of Zonotopes

### A Class of Topological Oriented Matroids with Some Applications to Non-linear Programming

Full PDF eBook Download Free

Author: Anders Björner

Publisher: Cambridge University Press

ISBN: 9780521777506

Category: Mathematics

Page: 548

View: 2422

*Equivalence Classes of Matrices Within a Natural Framework*

Author: Jürgen Bokowski

Publisher: Cambridge University Press

ISBN: 0521849306

Category: Computers

Page: 323

View: 8965

Author: Andrey O. Matveev

Publisher: Walter de Gruyter GmbH & Co KG

ISBN: 3110531143

Category: Mathematics

Page: 231

View: 9600

*An Introduction to Oriented Matroids*

Author: Achim Bachem,Walter Kern

Publisher: Springer Science & Business Media

ISBN: 3642581528

Category: Business & Economics

Page: 218

View: 1906

Author: Beth Spellman Munson

Publisher: N.A

ISBN: N.A

Category: Mathematics

Page: 270

View: 7551

Author: Francisco Santos

Publisher: American Mathematical Soc.

ISBN: 0821827693

Category: Mathematics

Page: 80

View: 462

Author: Walter Duff Morris

Publisher: N.A

ISBN: N.A

Category: Mathematics

Page: 90

View: 3637

Author: Walter Duff Morris

Publisher: N.A

ISBN: N.A

Category: Mathematics

Page: 222

View: 4242

*Second International Congress on Mathematical Software, Castro Urdiales, Spain, September 1-3, 2006, Proceedings*

Author: Andres Iglesias,Nobuki Takayama

Publisher: Springer Science & Business Media

ISBN: 3540380841

Category: Computers

Page: 452

View: 5126

*Discriminantal Arrangements, Oriented Matroids and Enumeration*

Author: Guy David Bailey

Publisher: N.A

ISBN: N.A

Category:

Page: 216

View: 2652

Author: Douglas Alan Miller

Publisher: N.A

ISBN: N.A

Category:

Page: 214

View: 7533