Border Complexity of Symbolic Determinant Under Rank One Restriction

Document Type

Conference Article

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs

Abstract

VBP is the class of polynomial families that can be computed by the determinant of a symbolic matrix of the form A0 + Pni=1 Aixi where the size of each Ai is polynomial in the number of variables (equivalently, computable by polynomial-sized algebraic branching programs (ABP)). A major open problem in geometric complexity theory (GCT) is to determine whether VBP is closed under approximation i.e. whether VBP =? VBP. The power of approximation is well understood for some restricted models of computation, e.g. the class of depth-two circuits, read-once oblivious ABPs (ROABP), monotone ABPs, depth-three circuits of bounded top fan-in, and width-two ABPs. The former three classes are known to be closed under approximation [4], whereas the approximative closure of the last one captures the entire class of polynomial families computable by polynomial-sized formulas [6]. In this work, we consider the subclass of VBP computed by the determinant of a symbolic matrix of the form A0 + Pni=1 Aixi where for each 1 ≤ i ≤ n, Ai is of rank one. This class has been studied extensively [12, 13, 21] and efficient identity testing algorithms are known for it [17, 15]. We show that this class is closed under approximation. In the language of algebraic geometry, we show that the set obtained by taking coordinatewise products of pairs of points from (the Plücker embedding of) a Grassmannian variety is closed.

DOI

10.4230/LIPIcs.CCC.2023.2

Publication Date

7-1-2023

This document is currently not available here.

Share

COinS