Algebraic Complexity and Invariant Theory

Algebraic complexity addresses the fundamental question of how efficiently one can compute polynomials and related algebraic objects. It employs models such as arithmetic circuits, branching programmes and formulas to quantify the number of operations—additions and multiplications—needed to evaluate a given polynomial family. Invariant theory, by contrast, investigates polynomial functions that remain unchanged under the action of a group, leading to the study of invariant rings, Hilbert bases and degree bounds. Over the past decade, these two disciplines have converged in a unified framework known as Geometric Complexity Theory (GCT), which uses tools from representation theory and algebraic geometry to approach longstanding lower‐bound problems, notably the separation of the permanent from the determinant. This interaction has yielded new structure theorems for non-commutative circuits, novel sum-of-squares techniques and refined degree bounds for invariant rings. The global significance of this synergy extends to cryptography, optimisation and symbolic computation, where an improved understanding of algebraic hardness informs both algorithm design and complexity‐theoretic separations. Concrete advances include algorithms for determinant‐degree computation via polyhedral interpretations, the refinement of support‐sum lower bounds that tie into major open questions in algebraic complexity classes, and constructive methods to generate invariants with minimal degree. Taken together, these developments highlight an emerging landscape in which symmetry, geometry and computation interlock to address some of the most profound questions in theoretical computer science and pure mathematics.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Algebraic Complexity and Invariant Theory publication trend

The graph below shows the total number of articles in algebraic complexity and invariant theory across all publications each year (not limited to Nature Index journals).

Technical terms

Arithmetic circuit: A directed acyclic network of addition and multiplication gates computing a polynomial over a field.

Invariant ring: The algebra of polynomial functions on a vector space that remain fixed under a specified group action.

Geometric Complexity Theory (GCT): A programme using algebraic geometry and representation theory to derive complexity lower bounds via orbit closures and representation-theoretic obstructions.

VP and VNP: Classes of polynomial families analogous to P and NP, where VP contains families computable by polynomial-size circuits and VNP those expressible as projections of exponential sums.

Sum-of-Squares representation: A decomposition of a polynomial as a weighted sum of square polynomials, used to certify nonnegativity or derive complexity lower bounds.

Degree bound: An upper limit on the degrees of generators needed to span an invariant ring under a group action.

References

1. Non-commutative circuits and the sum-of-squares problem. Journal of the American Mathematical Society (2011).
2. Unifying Known Lower Bounds via Geometric Complexity Theory. computational complexity (2015).
3. Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP≠VNP. computational complexity (2024).
4. A note on the degree bounds of the invariant ring. AIMS Mathematics (2024).
5. A cost-scaling algorithm for computing the degree of determinants. computational complexity (2022).
6. CONSTRUCTIVE NONCOMMMUTATIVE INVARIANT THEORY. Transformation Groups (2021).