Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

08/07/2017
by   Rohit Gurjar, et al.
0

We derandomize the famous Isolation Lemma by Mulmuley, Vazirani, and Vazirani for polytopes given by totally unimodular constraints. That is, we construct a weight assignment such that one vertex in such a polytope is isolated, i.e., there is a unique minimum weight vertex. Our weights are quasi-polynomially bounded and can be constructed in quasi-polynomial time. In fact, our isolation technique works even under the weaker assumption that every face of the polytope lies in an affine space defined by a totally unimodular matrix. This generalizes the recent derandomization results for bipartite perfect matching and matroid intersection. We prove our result by associating a lattice to each face of the polytope and showing that if there is a totally unimodular kernel matrix for this lattice, then the number of near-shortest vectors in it is polynomially bounded. The proof of this latter geometric fact is combinatorial and follows from a polynomial bound on the number of near-shortest circuits in a regular matroid. This is the technical core of the paper and relies on a variant of Seymour's decomposition theorem for regular matroids. It generalizes an influential result by Karger on the number of minimum cuts in a graph to regular matroids. Both of our results, on lattices and matroids, should be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2018

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

We show that for any regular matroid on m elements and any α≥ 1, the num...
research
07/04/2022

Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs

In vertex-cut sparsification, given a graph G=(V,E) with a terminal set ...
research
03/19/2020

A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings

In a recent paper, Beniamini and Nisan <cit.> gave a closed-form formula...
research
04/18/2020

Mapping Matchings to Minimum Vertex Covers: Kőnig's Theorem Revisited

It is a celebrated result in early combinatorics that, in bipartite grap...
research
01/22/2019

Dualization in lattices given by implicational bases

It was recently proved that the dualization in lattices given by implica...
research
03/29/2023

Planar 3-way Edge Perfect Matching Leads to A Holant Dichotomy

We prove a complexity dichotomy theorem for a class of Holant problems o...
research
04/30/2021

Formalizing the Face Lattice of Polyhedra

Faces play a central role in the combinatorial and computational aspects...

Please sign up or login with your details

Forgot password? Click here to reset