Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization

Orit E. Raz*, Avi Wigderson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field). This class was introduced, in a different language, by Lovász [16] in his study of flats in matroids, and proved a duality theorem putting this problem in $$NP \cap coNP$$. As such, our result is another demonstration where “good characterization” in the sense of Edmonds leads to an efficient algorithm. In a different paper Lovász [17] proved that all such symbolic rank problems have efficient probabilistic algorithms, namely are in BPP. As such, our algorithm may be interpreted as a derandomization result, in the long sequence special cases of the PIT (Polynomial Identity Testing) problem. Finally, Lovász and Yemini [20] showed how the same problem generalizes the graph rigidity problem in two dimensions. As such, our algorithm may be seen as a generalization of the well-known deterministic algorithm for the latter problem. There are two somewhat unusual technical features in this paper. The first is the translation of Lovász’ flats problem into a symbolic rank one. The second is the use of submodular optimization for derandomization. We hope that the tools developed for both will be useful for related problems, in particular for better understanding of graph rigidity in higher dimensions.

Original languageAmerican English
Title of host publicationBuilding Bridges II - Mathematics of László Lovász
EditorsImre Bárány, Gyula O. Katona, Attila Sali
PublisherSpringer Science and Business Media Deutschland GmbH
Pages377-415
Number of pages39
ISBN (Print)9783662592038
DOIs
StatePublished - 2019
Externally publishedYes
EventMathematical Conference to celebrate 70th birthday of Laszlo Lovasz, 2018 - Budapest, Hungary
Duration: 2 Jul 20186 Jul 2018

Publication series

NameBolyai Society Mathematical Studies
Volume28
ISSN (Print)1217-4696

Conference

ConferenceMathematical Conference to celebrate 70th birthday of Laszlo Lovasz, 2018
Country/TerritoryHungary
CityBudapest
Period2/07/186/07/18

Bibliographical note

Publisher Copyright:
© 2019, János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature.

Keywords

  • Derandomization
  • Graph rigidity
  • Symbolic matrix rank

Fingerprint

Dive into the research topics of 'Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization'. Together they form a unique fingerprint.

Cite this