Document

# Testing Equivalence to Design Polynomials

## File

LIPIcs.STACS.2024.9.pdf
• Filesize: 0.89 MB
• 22 pages

## Acknowledgements

We thank the reviewers for their valuable feedback, which has helped us improve the presentation of this work. In particular, we thank one of the reviewers who pointed us to appropriate citations for the adjoint algebra.

## Cite As

Omkar Baraskar, Agrim Dewan, and Chandan Saha. Testing Equivalence to Design Polynomials. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 9:1-9:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.STACS.2024.9

## Abstract

An n-variate polynomial g of degree d is a (n,d,t) design polynomial if the degree of the gcd of every pair of monomials of g is at most t-1. The power symmetric polynomial PSym_{n,d} : = ∑_{i = 1}ⁿ x^d_i and the sum-product polynomial SP_{s,d} : = ∑_{i = 1}^{s}∏_{j = 1}^{d} x_{i,j} are instances of design polynomials for t = 1. Another example is the Nisan-Wigderson design polynomial NW, which has been used extensively to prove various arithmetic circuit lower bounds. Given black-box access to an n-variate, degree-d polynomial f(𝐱) ∈ 𝔽[𝐱], how fast can we check if there exist an A ∈ GL(n, 𝔽) and a 𝐛 ∈ 𝔽ⁿ such that f(A𝐱+𝐛) is a (n,d,t) design polynomial? We call this problem "testing equivalence to design polynomials", or alternatively, "equivalence testing for design polynomials". In this work, we present a randomized algorithm that finds (A, 𝐛) such that f(A𝐱+𝐛) is a (n,d,t) design polynomial, if such A and 𝐛 exist, provided t ≤ d/3. The algorithm runs in (nd)^O(t) time and works over any sufficiently large 𝔽 of characteristic 0 or > d. As applications of this test, we show two results - one is structural and the other is algorithmic. The structural result establishes a polynomial-time equivalence between the graph isomorphism problem and the polynomial equivalence problem for design polynomials. The algorithmic result implies that Patarin’s scheme (EUROCRYPT 1996) can be broken in quasi-polynomial time if a random sparse polynomial is used in the key generation phase. We also give an efficient learning algorithm for n-variate random affine projections of multilinear degree-d design polynomials, provided n ≥ d⁴. If one obtains an analogous result under the weaker assumption "n ≥ d^ε, for any ε > 0", then the NW family is not VNP-complete unless there is a VNP-complete family whose random affine projections are learnable. It is not known if random affine projections of the permanent are learnable. The above algorithms are obtained by using the vector space decomposition framework, introduced by Kayal and Saha (STOC 2019) and Garg, Kayal and Saha (FOCS 2020), for learning non-degenerate arithmetic circuits. A key technical difference between the analysis in the papers by Garg, Kayal and Saha (FOCS 2020) and Bhargava, Garg, Kayal and Saha (RANDOM 2022) and the analysis here is that a certain adjoint algebra, which turned out to be trivial (i.e., diagonalizable) in prior works, is non-trivial in our case. However, we show that the adjoint arising here is triangularizable which then helps in carrying out the vector space decomposition step.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Algebraic complexity theory
##### Keywords
• Polynomial equivalence
• design polynomials
• graph isomorphism
• vector space decomposition

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Scott Aaronson. Arithmetic natural proofs theory is sought. http://www.scottaaronson.com/blog/?p=336, 2008.
2. Manindra Agrawal and Nitin Saxena. Automorphisms of finite rings and applications to complexity of problems. In Proceedings of the 22nd Annual Conference on Theoretical Aspects of Computer Science, STACS'05, pages 1-17, Berlin, Heidelberg, 2005. Springer-Verlag. URL: https://doi.org/10.1007/978-3-540-31856-9_1.
3. Manindra Agrawal and Nitin Saxena. Equivalence of F-algebras and cubic forms. In Proceedings of the 23rd Annual Conference on Theoretical Aspects of Computer Science, STACS'06, pages 115-126, Berlin, Heidelberg, 2006. Springer-Verlag. URL: https://doi.org/10.1007/11672142_8.
4. Manuel Araújo. Classification of quadratic forms. https://www.math.tecnico.ulisboa.pt/~ggranja/manuel.pdf, 2011.
5. Vikraman Arvind, Bireswar Das, Johannes Köbler, and Seinosuke Toda. Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica, 71(1):120-138, 2015. Conference version appeared in the proceedings of FSTTCS 2010. URL: https://doi.org/10.1007/s00453-013-9787-y.
6. László Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 684-697. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897542.
7. Omkar Baraskar, Agrim Dewan, and Chandan Saha. Testing equivalence to design polynomials. Electronic Colloquium on Computational Complexity (ECCC), 2024. URL: https://eccc.weizmann.ac.il/report/2024/004/.
8. Elwyn R. Berlekamp. Factoring polynomials over large finite fields. In Stanley R. Petrick, Jean E. Sammet, Robert G. Tobey, and Joel Moses, editors, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, SYMSAC 1971, Los Angeles, California, USA, March 23-25, 1971, page 223. ACM, 1971. URL: https://doi.org/10.1145/800204.806290.
9. Vishwas Bhargava, Ankit Garg, Neeraj Kayal, and Chandan Saha. Learning generalized depth three arithmetic circuits in the non-degenerate case. In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference), volume 245 of LIPIcs, pages 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.21.
10. Markus Bläser, B. V. Raghavendra Rao, and Jayalal Sarma. Testing polynomial equivalence by scaling matrices. In Ralf Klasing and Marc Zeitoun, editors, Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings, volume 10472 of Lecture Notes in Computer Science, pages 111-122. Springer, 2017. URL: https://doi.org/10.1007/978-3-662-55751-8_10.
11. Peter A. Brooksbank, Joshua Maglione, and James B. Wilson. A fast isomorphism test for groups whose lie algebra has genus 2. Journal of Algebra, Volume 473, Pages 545-590, ISSN 0021-8693, 2017. URL: https://doi.org/10.1016/j.jalgebra.2016.12.007.
12. Suryajith Chillara, Coral Grichener, and Amir Shpilka. On hardness of testing equivalence to sparse polynomials under shifts. In Petra Berenbrink, Patricia Bouyer, Anuj Dawar, and Mamadou Moustapha Kanté, editors, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany, volume 254 of LIPIcs, pages 22:1-22:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.STACS.2023.22.
13. Alexander Chistov, Gábor Ivanyos, and Marek Karpinski. Polynomial time algorithms for modules over finite dimensional algebras. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC '97, pages 68-74, New York, NY, USA, 1997. Association for Computing Machinery. URL: https://doi.org/10.1145/258726.258751.
14. Richard A. DeMillo and Richard J. Lipton. A probabilistic remark on algebraic program testing. Inf. Process. Lett., 7(4):193-195, 1978. URL: https://doi.org/10.1016/0020-0190(78)90067-4.
15. Ankit Garg, Nikhil Gupta, Neeraj Kayal, and Chandan Saha. Determinant equivalence test over finite fields and over Q. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 62:1-62:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ICALP.2019.62.
16. Ankit Garg, Neeraj Kayal, and Chandan Saha. Learning sums of powers of low-degree polynomials in the non-degenerate case. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 889-899. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00087.
17. Joshua A. Grochow. Symmetry and equivalence relations in classical and geometric complexity theory. PhD thesis, University of Chicago, Chicago, IL, 2012. URL: https://home.cs.colorado.edu/~jgrochow/grochow-thesis.pdf.
18. Joshua A. Grochow and Youming Qiao. On the complexity of isomorphism problems for tensors, groups, and polynomials I: tensor isomorphism-completeness. SIAM J. Comput., 52(2):568-617, 2023. Conference version appeared in the proceedings of ITCS 2021. URL: https://doi.org/10.1137/21M1441110.
19. Joshua A. Grochow and Youming Qiao. On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications. CoRR, abs/2306.16317, 2023. URL: https://doi.org/10.48550/arXiv.2306.16317.
20. Nikhil Gupta and Chandan Saha. On the symmetries of and equivalence test for design polynomials. In Peter Rossmanith, Pinar Heggernes, and Joost-Pieter Katoen, editors, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, volume 138 of LIPIcs, pages 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.MFCS.2019.53.
21. Nikhil Gupta, Chandan Saha, and Bhargav Thankey. Equivalence test for read-once arithmetic formulas. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 4205-4272. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch162.
22. Erich L. Kaltofen and Barry M. Trager. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symb. Comput., 9(3):301-320, 1990. Conference version appeared in the proceedings of FOCS 1988. URL: https://doi.org/10.1016/S0747-7171(08)80015-6.
23. Neeraj Kayal. Efficient algorithms for some special cases of the polynomial equivalence problem. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pages 1409-1421. SIAM, 2011. URL: https://doi.org/10.1137/1.9781611973082.108.
24. Neeraj Kayal. Affine projections of polynomials: extended abstract. In Howard J. Karloff and Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 643-662. ACM, 2012. URL: https://doi.org/10.1145/2213977.2214036.
25. Neeraj Kayal, Vineet Nair, and Chandan Saha. Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. Comput. Complex., 28(4):749-828, 2019. URL: https://doi.org/10.1007/S00037-019-00189-0.
26. Neeraj Kayal, Vineet Nair, Chandan Saha, and Sébastien Tavenas. Reconstruction of full rank algebraic branching programs. ACM Trans. Comput. Theory, 11(1):2:1-2:56, 2019. Conference version appeared in the proceedings of CCC 2017. URL: https://doi.org/10.1145/3282427.
27. Neeraj Kayal and Chandan Saha. Reconstruction of non-degenerate homogeneous depth three circuits. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 413-424. ACM, 2019. URL: https://doi.org/10.1145/3313276.3316360.
28. Krull-Schmidt Theorem. URL: https://mathstrek.blog/2015/01/17/krull-schmidt-theorem/.
29. T. Y. Lam. Introduction To Quadratic Forms Over Fields. American Mathematical Society, 2004.
30. Arjen K Lenstra, Hendrik W Lenstra, and László Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261(4):515-534, 1982. URL: https://doi.org/10.1007/BF01457454.
31. Dori Medini and Amir Shpilka. Hitting sets and reconstruction for dense orbits in vp_eand ΣΠΣ circuits. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference), volume 200 of LIPIcs, pages 19:1-19:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.CCC.2021.19.
32. Gary L. Miller. Graph isomorphism, general remarks. J. Comput. Syst. Sci., 18(2):128-142, 1979. URL: https://doi.org/10.1016/0022-0000(79)90043-6.
33. Janaky Murthy, Vineet Nair, and Chandan Saha. Randomized polynomial-time equivalence between determinant and trace-imm equivalence tests. In Javier Esparza and Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, volume 170 of LIPIcs, pages 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.MFCS.2020.72.
34. Jacques Patarin. Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In Ueli M. Maurer, editor, Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding, volume 1070 of Lecture Notes in Computer Science, pages 33-48. Springer, 1996. URL: https://doi.org/10.1007/3-540-68339-9_4.
35. Nitin Saxena. Morphisms of rings and applications to complexity. PhD thesis, Indian Institute of Technology, Kanpur, 2006. URL: https://www.cse.iitk.ac.in/users/manindra/Students/thesis_saxena.pdf.
36. Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701-717, 1980. URL: https://doi.org/10.1145/322217.322225.
37. Thomas Thierauf. The isomorphism problem for read-once branching programs and arithmetic circuits. Chic. J. Theor. Comput. Sci., 1998, 1998. URL: http://cjtcs.cs.uchicago.edu/articles/1998/1/contents.html.
38. Leslie G. Valiant. Completeness classes in algebra. In Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, and Alfred V. Aho, editors, Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA, pages 249-261. ACM, 1979. URL: https://doi.org/10.1145/800135.804419.
39. Joachim von zur Gathen and Jürgen Gerhard. Modern computer algebra (2. ed.). Cambridge University Press, 2003.
40. James B. Wilson. Decomposing p-groups via Jordan algebras. Journal of Algebra, Volume 322, Issue 8, Pages 2642-2679, ISSN 0021-8693,, 2009. URL: https://doi.org/10.1016/j.jalgebra.2009.07.029.
41. Richard Zippel. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation, EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings, pages 216-226, 1979. URL: https://doi.org/10.1007/3-540-09519-5_73.
X

Feedback for Dagstuhl Publishing