Möbius-Pseudorandomness for Algebraic Circuits
We define a notion of Möbius-pseudorandomness for integer sequences generated by multivariate polynomials computed by small and simple algebraic circuits. This mirrors a related definition of Kalai that concerns boolean functions computed by small boolean circuits. We then prove Möbius-pseudorandomness results for polynomials computed by algebraic circuits with few multiplication gates (of any depth), for polynomials with small-dimensional partial derivative space, and for the determinant and permanent. We conjecture that these results hold in general for polynomial-size algebraic circuits.
Authors
- Gil Kalai (ORCID: https://orcid.org/0000-0003-0982-1000)
- Ben Lee Volk (ORCID: https://orcid.org/0000-0002-7143-7280)
- Mrinal Kumar
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.21201
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint