Symmetric matroid polytopes and their generation

نویسندگان

  • Jürgen Bokowski
  • David Bremner
  • Gábor Gévay
چکیده

The study of polyhedra within the framework of oriented matroids has become a natural approach. Methods for enumerating combinatorial types of convex polytopes inductively within the Euclidean setting alone have not been established. In contrast, the oriented matroid concept allows one to generate matroid polytopes inductively. Matroid polytopes, when not interesting in their own right as topological balls with certain sphere properties, form an intermediate structure to search for realizable convex spheres. We provide in this article an interesting class of self-polar 3-spheres that stimulated research in this area. What are effective methods of generating matroid polytopes with prescribed properties? Having in mind open problems for which a corresponding solution is still open, we present the class of 3spheres of Gábor Gévay that were found independently by other authors as well. We discuss two new algorithmical methods of David Bremner and of Jürgen Bokowski for generating matroid polytopes that were tested in this context.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ehrhart Polynomials of Matroid Polytopes and Polymatroids

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss...

متن کامل

Matroids and Coxeter groups

The paper describes a few ways in which the concept of a Coxeter group (in its most ubiquitous manifestation, the symmetric group) emerges in the theory of ordinary matroids: • Gale’s maximality principle which leads to the Bruhat order on the symmetric group; • Jordan–Hölder permutation which measures distance between two maximal chains in a semimodular lattice and which happens to be closely ...

متن کامل

Flag enumerations of matroid base polytopes

In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.

متن کامل

Lattice Path Matroid Polytopes

Fix two lattice paths P and Q from (0, 0) to (m, r) that use East and North steps with P never going above Q. Bonin et al. in [1] show that the lattice paths that go from (0, 0) to (m, r) and remain bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call it a lattice path matroid. In this paper, we consider properties of lattice path matroi...

متن کامل

Geometry, Complexity, and Combinatorics of Permutation Polytopes

Each group G of permutation matrices gives rise to a permutation polytope P(G) = cony(G) c Re×d, and for any x ~ W, an orbit polytope P(G, x) = conv(G, x). A broad subclass is formed by the Young permutation polytopes, which correspond bijectively to partitions 2 = (21, ..., 2k)~-n of positive integers, and arise from the Young representations of the symmetric group. Young polytopes provide a f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009