Polynomial-size black-box identity testing for noncommutative rational formulas

Lineage and corrections

This event attributed to Unreleased internal OpenAI model

Companion: Uniform Matrix Hitting Points in Every Positive Characteristic evidence for this event

Polynomial-size black-box identity testing for noncommutative rational formulas parent of this event

Lean: polynomial hitting lists for rational formulas evidence for this event

Arvind, Chatterjee and Mukhopadhyay (2023), quasipolynomial black-box rational identity testing evidence for this event

Lean: single rational hitting tuple for division-free formulas evidence for this event

Lean comparator statement: RationalHitting evidence for this event

Companion: One Rational Matrix Hitting Point for Noncommutative Formulas evidence for this event

VibeMathed record: Polynomial-size black-box identity testing for noncommutative rational formulas evidence for this event

Deterministic black-box noncommutative singularity testing for rational linear matrices (Garg-Gurvits-Oliveira-Wigderson question) evidence for this event

Claims deterministic polynomial-time construction of polynomial-size rational matrix hitting lists for noncommutative rational formulas over $\mathbb Q$, with no bound on inverse nesting or constant heights, each nonzero formula receiving an invertible value. Companions: one rational tuple of dimension at most $2ns^2$ hits every nonzero division-free formula over every characteristic-zero field, and an analogous tuple over $\mathbb F_p$ works in each positive characteristic. It does NOT cover general noncommutative circuits, and the rational result is over $\mathbb Q$ only. parent of this event