Black-box identity testing for affine orbits of read-once oblivious algebraic branching programs

Primarily AI-generated textHuman understanding: no partscs.CC — Computational Complexity

Contributed by Yilin Liu ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

For every fixed width, we construct a polynomial-size hitting set for read-once oblivious algebraic branching programs under an unknown invertible affine change of variables. A width bound in a single unknown order suffices. The resulting deterministic black-box identity test runs in time polynomial in the number of variables and the total degree over every field with more elements than the degree. The construction preserves the generic ranks of consecutive matrix products in descending order. At fixed dimension and width, the query count is linear in the total degree in characteristic zero or above the individual degree in the hidden coordinates. When the width bound holds in every order, cut ranks give linear dependence up to logarithmic factors even in small characteristic. We also treat multivariate layers with bounded overlap and obtain a linear query bound for bivariate programs of width two.

Provenance statement

The author used OpenAI models to formulate results, develop and review proofs, draft the manuscript, and implement finite checks. The source manuscripts were prepared with GPT-6 Astra Pro.

References

  1. V. Bhargava and S. Ghosh. Improved hitting set for orbit of ROABPs (https://doi.org/10.1007/s00037-022-00230-9). Computational Complexity 31 (2022), article 15.DOI
  2. Z. Dvir, S. Kopparty, S. Saraf and M. Sudan. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers (https://doi.org/10.1137/100783704). SIAM Journal on Computing 42 (2013), 2305--2328.DOI
  3. M. Eberl. Concrete bounds for Chebyshev's prime counting functions (https://isa-afp.org/entries/Chebyshev_Prime_Bounds.html). Archive of Formal Proofs (2024).link
  4. A. Garcia and R. F. Lax. Weierstrass weight of Gorenstein singularities with one or two branches (https://arxiv.org/abs/alg-geom/9208003). arXiv:alg-geom/9208003 (1992).arXiv
  5. R. Gurjar, A. Korwar and N. Saxena. Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs (https://doi.org/10.4086/toc.2017.v013a002). Theory of Computing 13(2) (2017), 1--21.DOI
  6. V. Guruswami and S. Kopparty. Explicit subspace designs (https://eccc.weizmann.ac.il/report/2013/060/). Combinatorica 36 (2016), 161--185 (https://doi.org/10.1007/s00493-014-3169-1).DOI
  7. I. Hu, D. van Melkebeek and A. Morgan. Polynomial identity testing via evaluation of rational functions (https://doi.org/10.4086/toc.2024.v020a001). Theory of Computing 20(1) (2024), 1--70.DOI
  8. N. Kashyap. Matroid pathwidth and code trellis complexity (https://doi.org/10.1137/070691152). SIAM Journal on Discrete Mathematics 22 (2008), 256--272.DOI
  9. J. M. Landsberg and L. Manivel. On the ideals of secant varieties of Segre varieties (https://arxiv.org/abs/math/0311388). Foundations of Computational Mathematics 4 (2004), 397--422 (https://doi.org/10.1007/s10208-003-0115-9).DOI
  10. Yilin Liu and GPT-6 Astra Pro. Affine-orbit polynomial identity testing (https://github.com/icekylinx/algorithm-frontier/tree/77140c264e7cc9e7d2853a7cc86c76f4a7ad7d28/problems/roabp-affine-pit). Algorithm Frontier , source snapshot 77140c2 (2026).link
Show all 15 referencesShow fewer references
  1. R. D. Neidinger. Multivariate polynomial interpolation in Newton forms (https://doi.org/10.1137/17M1124188). SIAM Review 61 (2019), 361--381.DOI
  2. C. Saha and B. Thankey. Hitting sets for orbits of circuit classes and polynomial families (https://doi.org/10.1145/3665800). ACM Transactions on Computation Theory 16(3) (2024), article 14.DOI
  3. A. Shpilka. https://eccc.weizmann.ac.il/report/2026/314/ Polynomial-size hitting sets for multilinear any-order read-once algebraic branching programs and for set-multilinear depth-33 circuits with constant-size variable sets . ECCC TR26-314 (2026).link
  4. A. Shpilka and I. Volkovich. On reconstruction and testing of read-once formulas (https://theoryofcomputing.org/articles/v010a018/). Theory of Computing 10(18) (2014), 465--514.link
  5. S. Singh and V. Singh. An algebraic rigidity framework for order-oblivious deterministic black-box PIT of ROABPs (https://arxiv.org/abs/2602.13449v1). arXiv:2602.13449v1 (2026).arXiv

Version history

  1. v1 · 18 pagesSubmitted by Yilin LiuInitial depositCurrentNov 19, 2026