M ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
نویسندگان
چکیده
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obtained from matroids that belong to a few basic classes through k-sums. Also suppose that these basic classes are such that, whenever a class contains all graphic matroids, it does not contain all cographic matroids. We show that in that case 3-sums will not suffice.
منابع مشابه
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملExtended Formulations for Independence Polytopes of Regular Matroids
Abstract. We show that the independence polytope of every regular matroid has an extended formulation of size quadratic in the size of its ground set. This generalizes a similar statement for (co-)graphic matroids, which is a simple consequence of Martin’s [9] extended formulation for the spanning-tree polytope. In our construction, we make use of Seymour’s decomposition theorem for regular mat...
متن کاملMatroid Secretary for Regular and Decomposable Matroids
In the matroid secretary problem we are given a stream of elements in random order and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocable: if we choose to accept an element when it is presented by the stream then we can never get ri...
متن کاملar X iv : m at h / 02 04 00 7 v 3 [ m at h . C O ] 1 4 M ay 2 00 2 Fat 4 - polytopes and fatter 3 - spheres
We introduce the fatness parameter of a 4-dimensional polytope P, defined as φ(P) = ( f1 + f2)/( f0 + f3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4polytopes bounded? We describe and analyze a hyperbolic geometry construction that produces 4-polytopes with fatness φ(P) > 5.048, as well as the first infinite family of 2-simple, 2-s...
متن کاملA Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme (FPRAS) for the class of graphic matroids. On the other hand, the authors have previously shown, subject to a complexity-theoretic assumption, that there is no FP...
متن کامل