Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals

  title={Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals},
  author={Robert Andrews and Michael A. Forbes},
  journal={Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing},
  • Robert AndrewsMichael A. Forbes
  • Published 1 December 2021
  • Mathematics, Computer Science
  • Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
We show that any nonzero polynomial in the ideal generated by the r × r minors of an n × n matrix X can be used to efficiently approximate the determinant. Specifically, for any nonzero polynomial f in this ideal, we construct a small depth-three f-oracle circuit that approximates the Θ(r1/3) × Θ(r1/3) determinant in the sense of border complexity. For many classes of algebraic circuits, this implies that every nonzero polynomial in the ideal generated by r × r minors is at least as hard to… 

Simple Hard Instances for Low-Depth Algebraic Proofs

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the

No short polynomials vanish on bounded rank matrices

We show that the shortest nonzero polynomials vanishing on bounded-rank matrices and skew-symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraically, this means that

Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits

  • P. DuttaNitin Saxena
  • Mathematics
    2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
Mulmuley and Sohoni (2001) proposed an ambitious program, the Geometric Complexity Theory (GCT), to prove $P\neq NP$ and related conjectures using algebraic geometry and representation theory.

On Matrix Multiplication and Polynomial Identity Testing

  • Robert Andrews
  • Mathematics
    2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially derandomize polynomial identity testing for small algebraic circuits. Letting

Lower bounds for Polynomial Calculus with extension variables over finite fields

An unsatisfiable system of polynomial equations over O(n log n) variables of degree O(log n) such that any Polynomial Calculus refutation over Fp with M extension variables requires size exp ( Ω(n2/(κ22κ(M+ n log(n)))) ) .



The Complexity of Factors of Multivariate Polynomials

It is proved that in the framework of algebraic complexity, there are no such families of polynomial functions ofPolynomially bounded degree over fields of characteristic zero.

Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials

Three theorems are presented that establish polynomial straight-line complexity for certain operations on polynomials given bystraight-line programs of unbounded input degree, and a higher order partial derivative in a single variable is shown.

A lower bound for polynomial calculus with extension rule

  • Yaroslav Alekseev
  • Mathematics, Computer Science
    Computational Complexity Conference
  • 2021
It is shown that the Polynomial Calculus proof system p-simulates Res-Lin and thus the system gets an alternative exponential lower bound for the size of Res- Lin refutations of the binary value principle.

Circuit Complexity, Proof Complexity, and Polynomial Identity Testing

A new and natural algebraic proof system, which has tight connections to (algebraic) circuit complexity, shows that any super-polynomial lower bound on any Boolean tautology in this proof system implies that the permanent does not have polynomial-size algebraic circuits (VNP≠VP).

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits

It is observed that the first super polynomial lower bounds against general algebraic circuits of all constant depths over all fields of characteristic 0 implies the first deterministic sub-exponential time algorithm for solving the Polynomial Identity Testing (PIT) problem for all small depth circuits using the known connection between algebraic hardness and randomness.

Hitting sets and reconstruction for dense orbits in VPe and ΣΠΣ circuits

This paper studies polynomials in VPe and in ΣΠΣ (polynomial-sized depth-3 circuits) whose orbits, under the action of the affine group GL n (F), are dense in their ambient class as well as giving reconstruction algorithms.

Closure Results for Polynomial Factorization

It is shown that all factors of degree loga n of polynomials with poly(n)size depth-k circuits have poly( n)-size circuits of depth O(k+ a) and partially answers a question of Shpilka–Yehudayoff and has applications to hardness–randomness tradeoffs for bounded-depth arithmetic circuits.

Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds

If Permanent requires superpolynomial-size arithmetic circuits, then one can test in subexponential time whether a given arithmetic circuit of polynomially bounded degree computes an identically zero polynomial.

Hardness-randomness tradeoffs for bounded depth arithmetic circuits

The methods of Impagliazzo and Kabanets imply that if the authors can derandomize polynomial identity testing for bounded depth circuits then NEXP does not have bounded depth arithmetic circuits, that is, either NEXP ⊄ P/poly or the Permanent is not computable byPolynomial size bounded Depth d arithmetic circuits.

A PSPACE construction of a hitting set for the closure of small algebraic circuits

It is shown that a host of other algebraic problems such as Noether Normalization Lemma, can also be solved in PSPACE deterministically, where earlier only randomized algorithms and EXPSPACE algorithms (or EXPH assuming the generalized Riemann hypothesis) were known.