Bipartite perfect matching as a real polynomial

Gal Beniamini; Noam Nisan

doi:10.1145/3406325.3451002

Bipartite perfect matching as a real polynomial

Gal Beniamini, Noam Nisan

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and (1-on(1))· 2n2 monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) the number of monomials is only exponential in I(n logn). Our proof relies heavily on the fact that the lattice of graphs which are "matching-covered"is Eulerian.

Original language	English
Title of host publication	STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Editors	Samir Khuller, Virginia Vassilevska Williams
Publisher	Association for Computing Machinery
Pages	1118-1131
Number of pages	14
ISBN (Electronic)	9781450380539
DOIs	https://doi.org/10.1145/3406325.3451002
State	Published - 15 Jun 2021
Event	53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy Duration: 21 Jun 2021 → 25 Jun 2021

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
Country/Territory	Italy
City	Virtual, Online
Period	21/06/21 → 25/06/21

Bibliographical note

Publisher Copyright:
© 2021 ACM.

Keywords

Bipartite Perfect Matching
Boolean Functions
Elementary Graphs

Access to Document

10.1145/3406325.3451002

Cite this

Beniamini, G., & Nisan, N. (2021). Bipartite perfect matching as a real polynomial. In S. Khuller, & V. V. Williams (Eds.), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (pp. 1118-1131). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/3406325.3451002

@inproceedings{b1b1efedbdfc46b695af985a0deb85e0,

title = "Bipartite perfect matching as a real polynomial",

abstract = "We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and (1-on(1))· 2n2 monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) the number of monomials is only exponential in I(n logn). Our proof relies heavily on the fact that the lattice of graphs which are {"}matching-covered{"}is Eulerian.",

keywords = "Bipartite Perfect Matching, Boolean Functions, Elementary Graphs",

author = "Gal Beniamini and Noam Nisan",

note = "Publisher Copyright: {\textcopyright} 2021 ACM.; 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 ; Conference date: 21-06-2021 Through 25-06-2021",

year = "2021",

month = jun,

day = "15",

doi = "10.1145/3406325.3451002",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "1118--1131",

editor = "Samir Khuller and Williams, {Virginia Vassilevska}",

booktitle = "STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing",

}

Beniamini, G & Nisan, N 2021, Bipartite perfect matching as a real polynomial. in S Khuller & VV Williams (eds), STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 1118-1131, 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, Virtual, Online, Italy, 21/06/21. https://doi.org/10.1145/3406325.3451002

Bipartite perfect matching as a real polynomial. / Beniamini, Gal; Nisan, Noam.
STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. ed. / Samir Khuller; Virginia Vassilevska Williams. Association for Computing Machinery, 2021. p. 1118-1131 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bipartite perfect matching as a real polynomial

AU - Beniamini, Gal

AU - Nisan, Noam

PY - 2021/6/15

Y1 - 2021/6/15

N2 - We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and (1-on(1))· 2n2 monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) the number of monomials is only exponential in I(n logn). Our proof relies heavily on the fact that the lattice of graphs which are "matching-covered"is Eulerian.

AB - We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and (1-on(1))· 2n2 monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) the number of monomials is only exponential in I(n logn). Our proof relies heavily on the fact that the lattice of graphs which are "matching-covered"is Eulerian.

KW - Bipartite Perfect Matching

KW - Boolean Functions

KW - Elementary Graphs

UR - http://www.scopus.com/inward/record.url?scp=85108162951&partnerID=8YFLogxK

U2 - 10.1145/3406325.3451002

DO - 10.1145/3406325.3451002

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85108162951

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 1118

EP - 1131

BT - STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

A2 - Khuller, Samir

A2 - Williams, Virginia Vassilevska

PB - Association for Computing Machinery

T2 - 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021

Y2 - 21 June 2021 through 25 June 2021

ER -

Bipartite perfect matching as a real polynomial

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this