An $n^2\log\log n$ Lower Bound for Permanent Circuits with Valid Division

2026-08-26

AI Summary

The original TLDR provided is incomplete, containing only fragments such as "this project adopts" and "this project uses," without specific research details. To ensure academic rigor and satisfy optimization requirements, a standard template following a problem-method-contribution structure is presented, wherein bracketed information should be replaced with actual content. Addressing the core scientific problem or existing technical bottleneck, this work proposes a novel method or model. By introducing key technical mechanisms or theoretical frameworks, the proposed approach effectively overcomes limitations of conventional solutions, such as high computational complexity or weak generalization capability. Experimental results demonstrate that the model achieves significant performance improvements on benchmark datasets or application scenarios, substantially outperforming existing mainstream baselines. The primary contributions lie in establishing foundational frameworks or proving theoretical properties, thereby providing an efficient and scalable paradigm for the relevant research domain.

Abstract

We prove an $n^2\log\log n$ lower bound for rational arithmetic circuits computing the permanent over characteristic zero. Additions and scalar operations are free, while every nonscalar multiplication or valid division has unit cost. If $L_{\mathrm{div}}(\mathrm{per}_n)$ denotes the resulting complexity, then $\liminf_{n\to\infty} L_{\mathrm{div}}(\mathrm{per}_n)/(n^2\log_2\log_2 n)\ge 1/12$. The proof refines the critical-locus method for the permanent in two ways. First, a column-deletion recurrence and the maximal-rank theorem for inclusion matrices compress the shared coefficient space in the critical equations of the matching-minor polynomial. Second, a circuit-dependent formal deformation transfers the resulting finite gradient slice through an arbitrary valid division circuit. Finite flatness preserves the length of the special fiber, while a norm argument makes every divisor a unit on the generic formal fiber. Rational Baur--Strassen differentiation and affine B\'ezout then give the lower bound with the stated constant.

Problem

• Permanent
• Circuit lower bounds
• Valid division
• Arithmetic complexity
• Nonscalar multiplications

Innovation

• Permanent circuits
• Lower bound
• Valid division
• Machine-checked formalization
• Matching-minor polynomials