arXiv 1701.005382017-01cs.DMmath.CO

Extended Formulations for Polytopes of Regular Matroids

Rohit Gurjar, Nisheeth K. Vishnoi

备注：: This paper has been withdrawn as there is an error in the proof of the main result. In particular, Claim 2.2 is not correct

英文摘要：

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

计数拟阵的子图多面体与独立多面体

Subgraph Polytopes and Independence Polytopes of Count Matroids

给定一个无向图，非空子图多面体是图对（F，S）的特征向量的凸包，其中S是节点的非空子集，F是S中两个端点都在S中的边的子集.我们得到了非空子图多面体与生成森林多面体之间的一个强关系。我们进一步表明，这些多面体提供多项式大小的计数拟阵的独立多面体的扩展配方，这推广了最近的结果岩田等人。指的是稀疏拟阵。作为一个副产品，我们得到了新的下界的扩张复杂性的生成森林多面体的独立多面体的扩张复杂性，这些拟阵。

2015-02-16cs.DMmath.CO

Extended Formulations for Independence Polytopes of Regular Matroids

The ancillary file Corrigendum.pdf contains an explanation why our proof does not work.

2019-09-12cs.DMmath.CO

delta-拟阵多面体的正则二进三角剖分

Regular dyadic triangulations of delta-matroid polytopes

Université libre de Bruxelles（布鲁塞尔自由大学）

本文证明每个delta-拟阵多面体（及更一般的整B型广义置换多面体）存在正则二进三角剖分，其最大单纯形体积为2的幂，并指出B型中唯一非幺模单纯形例外，基于B型根配置的完全二进性。

2026-09-17cs.DMmath.CO

扫描、多胞体、定向拟阵与排列的容许图

Sweeps, polytopes, oriented matroids, and allowable graphs of permutations

本文引入扫描定向拟阵与排列的容许图两种推广，以建模高维点构型的扫描偏序集，揭示了其与模超平面、Dilworth截断及广义Baues问题的联系，并证明伪扫描偏序集形变收缩为球面。

2023-10-25cs.CGcs.DMmath.CO

Extended formulations for matroid polytopes through randomized protocols

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the description of a polyhedron that linearly projects to $P$. We show that, if $P$ is the base polytope of any matroid, then $P$ admits an extended formulation whose size depends linearly on the hitting number of $P$. Our extended formulations generalize those of the spanning tree polytope given by Martin and Wong. Our proof is simple and short, and it goes throu…

2021-06-23cs.DMmath.COmath.OC

Regular matroids have polynomial extension complexity

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$ bound for the special case of (co)graphic matroids. However, the case of a general regular matroid was open, despite recent attempts. We also consider the extension complexity of circuit dominants of regular matroids, for which we give a $O(n^2)$ bound.

2019-12-20cs.DMmath.CO

更多相关论文收起更多论文

拟阵多胞形的相依随机舍入及其应用

Dependent Randomized Rounding for Matroid Polytopes and Applications

出于几个应用程序，我们考虑的问题，随机四舍五入的分数解决方案在拟阵（基）多面体的积分之一。我们考虑了管道舍入技术，并提出了一种新的技术，随机交换舍入。我们的主要技术成果是从这些舍入技术所产生的随机变量的函数的浓度范围。我们证明了这两种技术所产生的随机变量的线性函数的Bauffff型浓度界，以及随机交换舍入所产生的变量的单调子模函数的下尾指数界。（1）对于任意常数k和k>0，我们给出了极大化一个受1个拟阵和k个线性约束的单调次模函数的（1-1/e-模）-近似算法。(2)我们提出了一个结果，极大极小包装问题，涉及拟阵基约束。对于一般问题Min {lambda：x \in {0，1}^N，x \in B（M），Ax <= lambda b}，我们给出了一个O（log m / log log m）-逼近，其中m是填充约束的个数. (3)我们推广的连续贪心算法的问题，涉及多个子模函数，并使用它来找到一个（1-1/e-ε）-近似pareto集的问题，最大化一个常数的单调子模函数的拟阵约束。一个例子是次模块福利问题，我们正在寻找一个近似的帕累托集相对于个别球员的效用。

2009-11-06cs.DMcs.DS

稀疏拟阵的推广公式

Extended Formulations for Sparsity Matroids

证明了$(k,\ell)$ -稀疏拟阵的基多面体的多项式扩展形式的存在性。对于无向图$G=(V,E)$，当为$k \geq \ell$时公式的大小为$O(|V||E|)$，当为$k \leq \ell$时公式的大小为$O(|V|^2 |E|)$。为此，我们采用Faenza等人最近开发的技术，该技术使用随机通信协议。

2014-03-28cs.DMmath.COmath.OC

Exchange distance of basis pairs in split matroids

The basis exchange axiom has been a driving force in the development of matroid theory. However, the axiom gives only a local characterization of the relation of bases, which is a major stumbling block to further progress, and providing a global understanding of the structure of matroid bases is a fundamental goal in matroid optimization. While studying the structure of symmetric exchanges, Gabow proposed the problem that any pair of bases admits a sequence of symmetric exchanges. A different extension of the exchange axiom was proposed by White, who investigated the equivalence of compatible …

2022-11-22cs.DMmath.CO

一些0/1多面体需要指数大小扩展公式

Some 0/1 polytopes need exponential size extended formulations

我们证明，有0/1多面体P，不承认一个紧凑的LP制定。更精确地说，我们证明了对于每个n，存在一个集合X \subseteq {0，1}^n使得conv（X）必须具有至少2^{n/2 *（1-o（1））}的扩展复杂度。换句话说，每个可以线性投影到conv（X）上的多面体Q必须有指数数量的面。事实上，如果conv（X）被限制为拟阵多胞形，同样的结果也适用。条件NP不包含在P_{/poly}，我们的结果排除了任何紧凑的TSP多面体的存在，即使制定可能包含任意实数。

2011-04-30cs.CCcs.DMmath.CO

具有图余回路的正则拟阵

Regular Matroids with Graphic Cocircuits

我们引入了图形余回路的概念，并证明了一类具有图形余回路的正则拟阵属于符号图形拟阵。此外，我们提供了一个算法，确定是否有一个图的余圈的余图拟阵是符号图或没有。

2009-09-28cs.DM

Spanning Circuits in Regular Matroids

We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given terminal edges in a graph. The algorithmic study of the problem on regular matroids, a superclass of graphic matroids, was initiated by Gavenčiak, Král', and Oum [ICALP'12], who proved that the case of the problem with |T|=2 is fixed-parameter tractable (FPT) when parameterized by the length of the circuit. We extend the result of Gavenčiak, Král', and Oum b…

2016-07-19cs.DMcs.DS