计数拟阵的子图多面体与独立多面体
Subgraph Polytopes and Independence Polytopes of Count Matroids
摘要：
给定一个无向图，非空子图多面体是图对（F，S）的特征向量的凸包，其中S是节点的非空子集，F是S中两个端点都在S中的边的子集.我们得到了非空子图多面体与生成森林多面体之间的一个强关系。我们进一步表明，这些多面体提供多项式大小的计数拟阵的独立多面体的扩展配方，这推广了最近的结果岩田等人。指的是稀疏拟阵。作为一个副产品，我们得到了新的下界的扩张复杂性的生成森林多面体的独立多面体的扩张复杂性，这些拟阵。
英文摘要：
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong relationship between the non-empty subgraph polytope and the spanning forest polytope. We further show that these polytopes provide polynomial size extended formulations for independence polytopes of count matroids, which generalizes recent results obtained by Iwata et al. referring to sparsity matroids. As a byproduct, we obtain new lower bounds on the extension complexity of the spanning forest polytope in terms of extension complexities of independence polytopes of these matroids.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
