Deterministic Depth-4 PIT and Normalization

2025/04/21 by Guo, Zeyu, Wang, Siki
#Algebraic Geometry (math.AG) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2504.15143

Abstract

In this paper, we initiate the study of deterministic PIT for Σ^[k]ΠΣΠ^[δ] circuits over fields of any characteristic, where k and δ are bounded. Our main result is a deterministic polynomial-time black-box PIT algorithm for Σ^[3]ΠΣΠ^[δ] circuits, under the additional condition that one of the summands at the top Σ gate is squarefree. Our techniques are purely algebro-geometric: they do not rely on Sylvester--Gallai-type theorems, and our PIT result holds over arbitrary fields. The core of our proof is based on the normalization of algebraic varieties. Specifically, we carry out the analysis in the integral closure of a coordinate ring, which enjoys better algebraic properties than the original ring.

Related

• PIT for depth-4 circuits and Sylvester-Gallai conjecture for polynomials
• Rank Bounds and PIT for Σ³ ΠΣΠ^d circuits via a non-linear Edelstein-Kelly theorem
• Reconstruction of depth-3, top fan-in two circuits over characteristic zero fields
• Polynomial-Time PIT from (Almost) Necessary Assumptions
• Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits