Symmetric matroid polytopes and their generation

Authors:
Jürgen Bokowski;David Bremner;Gábor Gévay
Affiliations:
Department of Mathematics, Darmstadt University of Technology, Schlossgartenstrasse 7, D-64289 Darmstadt, Germany;Faculty of Computer Science, Box 4400, University of New Brunswick, Fredericton New Brunswick, E3B 5A3, Canada;Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, H-6720 Szeged, Hungary
Venue:
European Journal of Combinatorics
Year:
2009

Citing 5
Cited 0

A machine program for theorem-proving

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Effective Methods in Computational Synthetic Geometry

ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Computational Oriented Matroids

Computational Oriented Matroids
New polytopes from products

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.01

Visualization

Abstract

Matroid polytopes form an intermediate structure useful in searching for realizable convex spheres. In this article we present a class of self-polar 3-spheres that motivated research in the inductive generation of matroid polytopes, along with two new methods of generation.