Metraipolis › archive › dc_63f8626142cf

Hitting Sets for Polynomials with Small Partial Derivative Spaces — arXiv:2609.34436

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.34436
License (as archived)
CC0-1.0
Archived
2026-10-08T00:43:21.523Z
SHA-256 of the archived text
e317ba46508311e36807100f6fa2a2bf75c25be7d783e8d59b8125371e0fed17
Stable URL of this page
https://metraipolis.com/documento/dc_63f8626142cf

How to cite

Hitting Sets for Polynomials with Small Partial Derivative Spaces — arXiv:2609.34436 — arXiv (en), https://arxiv.org/abs/2609.34436 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_63f8626142cf (Metraipolis archive dc_63f8626142cf, sha256 e317ba46508311e36807100f6fa2a2bf75c25be7d783e8d59b8125371e0fed17)
BibTeX
@misc{dc63f8626142cf,
  title = {Hitting Sets for Polynomials with Small Partial Derivative Spaces — arXiv:2609.34436},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.34436},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_63f8626142cf; sha256 e317ba46508311e36807100f6fa2a2bf75c25be7d783e8d59b8125371e0fed17},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34436. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give an explicit hitting set of size $\text{poly}(n,d,r)$ for the class of $n$-variate degree-$d$ polynomials whose partial derivative space is bounded by $r$, over any field $\mathbb{F}$ of characteristic zero. In particular, this yields a polynomial sized hitting set for the class of depth-$3$ powering circuits. The main technical insight is the construction of a "formal derivation'' and properties of the associated Wronskian with respect to this derivation, which was previously studied by Moura [Moura_2004] in a very different context. The proofs in this paper are elementary and completely self-contained. AI disclosure: The proof of this result was obtained during conversations [astra_proof] with OpenAI GPT-6 Astra. The proof presented in this writeup is a rewriting (in the authors' words) of the proof obtained by the AI model in a form that we believe is understandable to researchers.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.34436 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T00:17:42.550Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).