Symmetric matroid polytopes and their generation

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.

[1]  G. Ziegler,et al.  Fat 4-polytopes and fatter 3-spheres , 2002, math/0204007.

[2]  N. Mnev.  The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .

[3]  Simon King,et al.  The Topological Representation of Oriented Matroids , 2005, Discret. Comput. Geom..

[4]  S. A. Robertson,et al.  Polytopes and symmetry , 1984 .

[5]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[6]  Michel Las Vergnas.  Bases in oriented matroids , 1978, J. Comb. Theory, Ser. B.

[7]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[8]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[9]  Andreas Paffenholz.  New polytopes from products , 2006, J. Comb. Theory, Ser. A.

[10]  Paul Althaus Smith,et al.  Pure and applied mathematics; : a series of monographs and textbooks. , 2003 .

[11]  Hyman Bass,et al.  Pure and Applied Mathematics A Series of Monographs and Textbooks , 1980 .

[12]  Günter M. Ziegler,et al.  The Et-Construction for Lattices, Spheres and Polytopes , 2004, Discret. Comput. Geom..

[13]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[14]  Komei Fukuda,et al.  Complete combinatorial generation of small point configurations and hyperplane arrangements , 2001, CCCG.

[15]  H. Coxeter,et al.  Generators and relations for discrete groups , 1957 .

[16]  Lukas Finschi,et al.  A graph theoretical approach for reconstruction and generation of oriented matroids , 2001 .

[17]  Lars Schewe.  Satisfiability Problems in Discrete Geometry , 2007 .

[18]  G. Ziegler.  Lectures on Polytopes , 1994 .

[19]  Ileana Streinu,et al.  A Topological Representation Theorem for Oriented Matroids , 2002, math/0209364.

[20]  Peter Kleinschmidt,et al.  On combinatorial and affine automorphisms of polytopes , 1984 .

[21]  Jim Lawrence,et al.  Oriented matroids , 1978, J. Comb. Theory B.

[22]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[23]  Automated deduction in geometry : Third International Workshop, ADG 2000, Zurich, Switzerland, September 25-27, 2000 : revised papers , 2001 .

[24]  António Guedes de Oliveira,et al.  On the Generation of Oriented Matroids , 2000, Discret. Comput. Geom..

[25]  P. Mani.  Automorphismen von polyedrischen Graphen , 1971 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  G. Ziegler,et al.  Many triangulated 3-spheres , 2002, math/0212004.

[28]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[29]  Juergen Bokowski.  Computational Oriented Matroids , 2006 .

[30]  Jürgen Bokowski.  Effective Methods in Computational Synthetic Geometry , 2000, Automated Deduction in Geometry.

[31]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[32]  Francisco Santos,et al.  Triangulations of oriented matroids , 2002 .

[33]  Walter Stromquist,et al.  Self-duality Groups and Ranks of Self-dualities , 1990, Applied Geometry And Discrete Mathematics.

[34]  B. Sturmfels.  Computational Synthetic Geometry , 1989 .

[35]  H. Crapo,et al.  A catalogue of combinatorial geometries , 1973 .

[36]  H. S. M. Coxeter,et al.  Regular and semi-regular polytopes. II , 1940 .

[37]  B. Sturmfels.  Oriented Matroids , 1993 .

[38]  Jürgen Bokowski,et al.  ON A SELF DUAL 3-SPHERE OF PETER MCMULLEN , 2000 .

[39]  On Perfect 4-Polytopes , 2002 .

[40]  Paul Hudak,et al.  A gentle introduction to Haskell , 1992, SIGP.