Rabbits Approximate, Cows Compute Exactly!

Komarath, B. and Pandey, A. and Saurabh, Nitin (2022) Rabbits Approximate, Cows Compute Exactly! In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 22 August 2022 through 26 August 2022, Vienna.

Text
LIPIcs.pdf - Published Version
Available under License Creative Commons Attribution.
Download (696kB)

Abstract

Valiant, in his seminal paper in 1979, showed an efficient simulation of algebraic formulas by determinants, showing that VF, the class of polynomial families computable by polynomial-sized algebraic formulas, is contained in VDet, the class of polynomial families computable by polynomialsized determinants. Whether this containment is strict has been a long-standing open problem. We show that algebraic formulas can in fact be efficiently simulated by the determinant of tetradiagonal matrices, transforming the open problem into a problem about determinant of general matrices versus determinant of tetradiagonal matrices with just three non-zero diagonals. This is also optimal in a sense that we cannot hope to get the same result for matrices with only two non-zero diagonals or even tridiagonal matrices, thanks to Allender and Wang (Computational Complexity'16) which showed that the determinant of tridiagonal matrices cannot even compute simple polynomials like x1x2 + x3x4 + + x15x16. Our proof involves a structural refinement of the simulation of algebraic formulas by width-3 algebraic branching programs by Ben-Or and Cleve (SIAM Journal of Computing'92). The tetradiagonal matrices we obtain in our proof are also structurally very similar to the tridiagonal matrices of Bringmann, Ikenmeyer and Zuiddam (JACM'18) which showed that, if we allow approximations in the sense of geometric complexity theory, algebraic formulas can be efficiently simulated by the determinant of tridiagonal matrices of a very special form, namely the continuant polynomial. The continuant polynomial family is closely related to the Fibonacci sequence, which was used to model the breeding of rabbits. The determinants of our tetradiagonal matrices, in comparison, is closely related to Narayana's cows sequences, which was originally used to model the breeding of cows. Our result shows that the need for approximation can be eliminated by using Narayana's cows polynomials instead of continuant polynomials, or equivalently, shifting one of the outer diagonals of a tridiagonal matrix one place away from the center. Conversely, we observe that the determinant (or, permanent) of band matrices can be computed by polynomial-sized algebraic formulas when the bandwidth is bounded by a constant, showing that the determinant (or, permanent) of bandwidth k matrices for all constants k ≥ 2 yield VF-complete polynomial families. In particular, this implies that the determinant of tetradiagonal matrices in general and Narayana's cows polynomials in particular yield complete polynomial families for the class VF. © 2022 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

[error in script]

IITH Creators:

IITH Creators	ORCiD
Saurabh, Nitin	https://orcid.org/0000-0002-1670-1114

Item Type:

Conference or Workshop Item (Paper)

Uncontrolled Keywords:

Algebraic branching programs, Algebraic complexity classes, Algebraic complexity theory, Algebraic formulas, Band matrices, Continuant, Determinant versus permanent, Narayana's cow sequence, Padovan sequence, Tetradiagonal matrices, Tridiagonal matrices

Subjects:

Computer science

Divisions:

Department of Computer Science & Engineering

Depositing User:

. LibTrainee 2021

Date Deposited:

20 Sep 2022 08:58

Last Modified:

20 Sep 2022 08:58

URI:

http://raiithold.iith.ac.in/id/eprint/10630