AI Chat AI Image Generator AI Video Text to Speech

Regular matroids have polynomial extension complexity

09/18/2019

∙

by Manuel Aprile, et al.

∙

∙

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.

Manuel Aprile
11 publications
Samuel Fiorini
16 publications

page 1

page 2

page 3

page 4

research

∙ 06/22/2021

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond

Let G be a connected n-vertex graph in a proper minor-closed class 𝒢. We...

0 Manuel Aprile, et al. ∙

research

∙ 12/09/2020

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1

A P_ℓ-decomposition of a graph G is a set of paths with ℓ edges in G tha...

0 Fábio Botler, et al. ∙

research

∙ 06/01/2018

Extension Complexity of the Correlation Polytope

We prove that for every n-vertex graph G, the extension complexity of th...

0 Pierre Aboulker, et al. ∙

research

∙ 05/12/2023

Complexity of conjunctive regular path query homomorphisms

A graph database is a digraph whose arcs are labeled with symbols from a...

0 Laurent Beaudou, et al. ∙

research

∙ 12/25/2022

A general construction of regular complete permutation polynomials

Let r≥ 3 be a positive integer and 𝔽_q the finite field with q elements....

0 Wei Lu, et al. ∙

research

∙ 05/29/2021

Efficient Folding Algorithms for Regular Polyhedra

We investigate the folding problem that asks if a polygon P can be folde...

0 Tonan Kamata, et al. ∙

research

∙ 10/22/2020

Gaussoids are two-antecedental approximations of Gaussian conditional independence structures

The gaussoid axioms are conditional independence inference rules which c...

0 Tobias Boege, et al. ∙