• Corpus ID: 244799306

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},
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 Θ( r 1 / 3 ) × Θ( r 1 / 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… 
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)))) ) .
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


Complexity in Ideals of Polynomials: Questions on Algebraic Complexity of Circuits and Proofs
This survey reviews connections & motivations, and raises many questions that it hopes will help shed light on the complexity land- scape of polynomials in ideals.
Discovering the roots: uniform closure results for algebraic classes under factoring
This work generalizes Newton iteration to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously and shows that under a random linear transformation τ, f(τx) completely factors via power series roots and adapts well to circuit complexity analysis.
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.
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
The orbit of an n -variate polynomial f ( x ) over a field F is the set orb ( f ) : = { f ( A x + b ) : A ∈ GL ( n , F ) and b ∈ F n } . This paper studies explicit hitting sets for the orbits of
A generalized sylvester-gallai type theorem for quadratic polynomials
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of
Factors of low individual degree polynomials
  • R. Oliveira
  • Mathematics, Computer Science
    computational complexity
  • 2016
This work generalizes the main factorization theorem from Dvir et al. (2009), and introduces several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas).
An exponential lower bound for the sum of powers of bounded degree polynomials
  • N. Kayal
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 2012
The main theorem is a lower bound on the number of summands in any representation of the form (1) for an explicit polynomial f, which is an easy corollary of Fischer [Fis94].
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.
Sylvester-Gallai type theorems for quadratic polynomials
It is proved that if a finite collection Q, of irreducible polynomials of degree at most 2, satisfy that whenever Q1 and Q2 vanish then also Q3 vanishes, then the linear span of the polynomers in Q has dimension O(1), and a colored version of the theorem is proved.
Lower bounds for the polynomial calculus and the Gröbner basis algorithm
A matching upper bound on polynomial calculus proofs of the pigeonhole principle for any field of suficiently large characteristic, and an ⌈n/2⌉ + 1 lower bound for any subset sum problem over the field of reals are shown.