Bipartite Perfect Matching as a Real Polynomial

01/21/2020
by   Gal Beniamini, et al.
0

We obtain a description of the Bipartite Perfect Matching decision problem as a multi-linear polynomial over the Reals. We show that it has full degree and has (1-o(1))· 2^n^2 monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) there are only 2^θ(n log n) monomials with non-zero coefficients. Our proof relies heavily on the fact that the lattice of graphs which are “matching-covered” is Eulerian.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2020

The Dual Polynomial of Bipartite Perfect Matching

We obtain a description of the Boolean dual function of the Bipartite Pe...
research
03/02/2022

Algebraic Representations of Unique Bipartite Perfect Matching

We obtain complete characterizations of the Unique Bipartite Perfect Mat...
research
06/28/2021

Representing polynomial of CONNECTIVITY

We show that the coefficients of the representing polynomial of any mono...
research
03/01/2023

The Total Matching Polytope of Complete Bipartite Graphs

The total matching polytope generalizes the stable set polytope and the ...
research
11/30/2021

Facets of the Total Matching Polytope for bipartite graphs

The Total Matching Polytope generalizes the Stable Set Polytope and the ...
research
04/30/2021

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2 × 2 submatrices

In this paper, we consider the problem of computing the degree of the de...
research
04/05/2022

Hall-type theorems for fast almost dynamic matching and applications

A dynamic set of size up to K is a set in which elements can be inserted...

Please sign up or login with your details

Forgot password? Click here to reset