arXiv (All)
open access
A Quadratic Lower Bound on Determinantal Complexity
We prove an $Ω(n^2)$ lower bound on the determinantal complexity of the power sum polynomial $\sum_{i=1}^n x_i^n$ over the field of complex numbers. A similar result was claimed in a recent paper of Sheshadri (arXiv:2606.13628), via an AI-assisted and AI-written proof. Assuming its correctness, th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ideal Membership in Polynomial Calculus: Complexity and Reductions#1064787
- On the computation of rational solutions of underdetermined systems over a finite field#228842
- Proof of a Conjecture on Primitive Quartic Polynomials over Finite Fields#616599
- Proof of a Conjecture on Primitive Quartic Polynomials over Finite Fields#616099
- Representation Redundancy and Structural Complexity in Finite-Field Inversion#927858
Record · ID 1128732
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive