Rank Bounds and PIT for $Sigma^3 Pi Sigma Pi^d$ circuits via a non-linear Edelstein-Kelly theorem

2025-04-20

AI Summary

This work addresses polynomial identity testing (PIT) for depth-4 arithmetic circuits of the form $Sigma^3PiSigmaPi^d$, i.e., circuits with top fan-in 3 and bottom degree at most $d$. The central objective is to establish a constant-rank upper bound for such circuits computing the zero polynomial—thereby fully confirming the strong form of Gupta’s Conjecture 30 (2014) and resolving Beecken–Mittmann–Saxena’s Conjecture 28 (2013). Methodologically, we extend the Edelstein–Kelly theorem from linear forms to arbitrary constant-degree polynomials, integrating tools from algebraic geometry and nonlinear space partitioning to derive a tight rank bound. Our main contributions are: (1) a proof that $Sigma^3PiSigmaPi^d$ circuits admit a constant-rank upper bound; (2) the first deterministic polynomial-time PIT algorithm for this model; and (3) a pivotal advance in depth-4 PIT, significantly advancing arithmetic circuit complexity theory.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Machine Learning: Probabilistic Circuits and Graphical Models

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking

Abstract

We prove a non-linear Edelstein-Kelly theorem for polynomials of constant degree, fully settling a stronger form of Conjecture 30 in Gupta (2014), and generalizing the main result of Peleg and Shpilka (STOC 2021) from quadratic polynomials to polynomials of any constant degree. As a consequence of our result, we obtain constant rank bounds for depth-4 circuits with top fanin 3 and constant bottom fanin (denoted $Sigma^{3}PiSigmaPi^{d}$ circuits) which compute the zero polynomial. This settles a stronger form of Conjecture 1 in Gupta (2014) when $k=3$, for any constant degree bound; additionally this also makes progress on Conjecture 28 in Beecken, Mittmann, and Saxena (Information &Computation, 2013). Our rank bounds, when combined with Theorem 2 in Beecken, Mittmann, and Saxena (Information &Computation, 2013) yield the first deterministic, polynomial time PIT algorithm for $Sigma^{3}PiSigmaPi^{d}$ circuits.

Problem

• Prove non-linear Edelstein-Kelly theorem for constant-degree polynomials
• Establish constant rank bounds for depth-4 zero-computing circuits
• Develop deterministic polynomial-time PIT algorithm for Σ³ΠΣΠᵈ circuits

Innovation

• Non-linear Edelstein-Kelly theorem for polynomials
• Constant rank bounds for depth-4 circuits
• Deterministic polynomial time PIT algorithm