Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
Pages 106 - 117
Abstract
Rational Identity Testing (RIT) is the decision problem of determining whether or not a noncommutative rational formula computes zero in the free skew field. It admits a deterministic polynomial-time white-box algorithm [Garg, Gurvits, Oliveira, and Wigderson (2016); Ivanyos, Qiao, Subrahmanyam (2018); Hamada and Hirai (2021)], and a randomized polynomial-time algorithm [Derksen and Makam (2017)] in the black-box setting, via singularity testing of linear matrices over the free skew field. Indeed, a randomized NC algorithm for RIT in the white-box setting follows from the result of Derksen and Makam (2017). Designing an efficient deterministic black-box algorithm for RIT and understanding the parallel complexity of RIT are major open problems in this area. Despite being open since the work of Garg, Gurvits, Oliveira, and Wigderson (2016), these questions have seen limited progress. In fact, the only known result in this direction is the construction of a quasipolynomial-size hitting set for rational formulas of only inversion height two [Arvind, Chatterjee, and Mukhopadhyay (2022)]. In this paper, we significantly improve the black-box complexity of this problem and obtain the first quasipolynomial-size hitting set for all rational formulas of polynomial size. Our construction also yields the first deterministic quasi-NC upper bound for RIT in the white-box setting.
References
[1]
S.A Amitsur. 1966. Rational identities and applications to algebra and geometry. Journal of Algebra, 3, 3 (1966), 304 – 359. issn:0021-8693 https://doi.org/10.1016/0021-8693(66)90004-4
[2]
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, and C. Ramya. 2023. On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. In 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA, Yael Tauman Kalai (Ed.) (LIPIcs, Vol. 251). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, MIT, Cambridge, Massachusetts, USA. 6:1–6:23. https://doi.org/10.4230/LIPIcs.ITCS.2023.6
[3]
Vikraman Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay. 2022. Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022 (LIPIcs, Vol. 245). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, online. 23:1–23:22. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.23
[4]
Vikraman Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay. 2023. Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. https://doi.org/10.48550/ARXIV.2309.15647 arXiv:2309.15647.
[5]
Vikraman Arvind, Pushkar S. Joglekar, and Srikanth Srinivasan. 2009. Arithmetic Circuits and the Hadamard Product of Polynomials. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, IIT Kanpur, India. 25–36.
[6]
George M Bergman. 1976. Rational relations and rational identities in division rings. Journal of Algebra, 43(1) (1976), 252–266. https://doi.org/10.1016/0021-8693(76)90159-9.
[7]
Stuart J. Berkowitz. 1984. On Computing the Determinant in Small Parallel Time Using a Small Number of Processors. Inf. Process. Lett., 18, 3 (1984), 147–150. https://doi.org/10.1016/0020-0190(84)90018-8
[8]
Vishwas Bhargava, Markus Bläser, Gorav Jindal, and Anurag Pandey. 2019. A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, Timothy M. Chan (Ed.). SIAM, San Diego, California, USA. 647–661. https://doi.org/10.1137/1.9781611975482.41
[9]
Andrej Bogdanov and Hoeteck Wee. 2005. More on Noncommutative Polynomial Identity Testing. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. IEEE Computer Society, San Jose, CA, USA. 92–99. https://doi.org/10.1109/CCC.2005.13
[10]
Richard P. Brent. 1974. The Parallel Evaluation of General Arithmetic Expressions. J. ACM, 21, 2 (1974), 201–206. https://doi.org/10.1145/321812.321815
[11]
Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, and Avi Wigderson. 2019. Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, David Zuckerman (Ed.). IEEE Computer Society, Baltimore, Maryland, USA. 845–861. https://doi.org/10.1109/FOCS.2019.00055
[12]
P. M. Cohn. 1971. The Embedding of Firs in Skew Fields. Proceedings of the London Mathematical Society, s3-23, 2 (1971), 10, 193–213. issn:0024-6115 https://doi.org/10.1112/plms/s3-23.2.193 arxiv:https://academic.oup.com/plms/article-pdf/s3-23/2/193/4338970/s3-23-2-193.pdf.
[13]
P. M. Cohn. 1995. Skew Fields: Theory of General Division Rings. Cambridge University Press.
[14]
L. Csanky. 1976. Fast Parallel Matrix Inversion Algorithms. SIAM J. Comput., 5, 4 (1976), 618–623. https://doi.org/10.1137/0205040
[15]
Richard A. Demillo and Richard J. Lipton. 1978. A probabilistic remark on algebraic program testing. Inform. Process. Lett., 7, 4 (1978), 193 – 195. issn:0020-0190 https://doi.org/10.1016/0020-0190(78)90067-4
[16]
Harm Derksen and Visu Makam. 2017. Polynomial degree bounds for matrix semi-invariants. Advances in Mathematics, 310 (2017), 44–63. issn:0001-8708 https://doi.org/10.1016/j.aim.2017.01.018
[17]
Harm Derksen and Visu Makam. 2020. Algorithms for orbit closure separation for invariants and semi-invariants of matrices. Algebra & Number Theory, 14(10) (2020), 2791–2813.
[18]
Manfred Droste and Dietrich Kuske. 2021. Weighted automata. In Handbook of Automata Theory, Jean-Éric Pin (Ed.). European Mathematical Society Publishing House, Zürich, Switzerland, 113–150. https://doi.org/10.4171/Automata-1/4
[19]
Samuel Eilenberg. 1974. Automata, Languages, and Machines (Vol A). Academic Press.
[20]
Stephen Fenner, Rohit Gurjar, and Thomas Thierauf. 2016. Bipartite perfect matching is in quasi-NC. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC ’16). Association for Computing Machinery, New York, NY, USA. 754–763. isbn:9781450341325 https://doi.org/10.1145/2897518.2897564
[21]
Michael Andrew Forbes. 2014. Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Programs. Ph. D. Dissertation. MIT.
[22]
Michael A. Forbes and Amir Shpilka. 2013. Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA. IEEE Computer Society, Berkeley, CA, USA. 243–252. https://doi.org/10.1109/FOCS.2013.34
[23]
Marc Fortin and Christophe Reutenauer. 2004. Commutative/Noncommutative Rank of Linear Matrices and Subspaces of Matrices of Low Rank. Séminaire Lotharingien de Combinatoire [electronic only], 52 (2004), 01.
[24]
Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, and Avi Wigderson. 2016. A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, Irit Dinur (Ed.). IEEE Computer Society, Hyatt Regency, New Brunswick, New Jersey,USA. 109–117. https://doi.org/10.1109/FOCS.2016.95
[25]
Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, and Avi Wigderson. 2020. Operator Scaling: Theory and Applications. Found. Comput. Math., 20, 2 (2020), 223–290. https://doi.org/10.1007/s10208-019-09417-z
[26]
Rohit Gurjar and Thomas Thierauf. 2020. Linear Matroid Intersection is in Quasi-NC. Comput. Complex., 29, 2 (2020), 9. https://doi.org/10.1007/S00037-020-00200-Z
[27]
Masaki Hamada and Hiroshi Hirai. 2021. Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces. SIAM J. Appl. Algebra Geom., 5, 3 (2021), 455–478. https://doi.org/10.1137/20M138836X
[28]
Pavel Hrubeš and Avi Wigderson. 2015. Non-Commutative Arithmetic Circuits with Division. Theory of Computing, 11, 14 (2015), 357–393. https://doi.org/10.4086/toc.2015.v011a014
[29]
Loo-Keng Hua. 1949. Some Properties of a Sfield. Proceedings of the National Academy of Sciences of the United States of America, 35, 9 (1949), 533–537. issn:00278424
[30]
Gábor Ivanyos, Youming Qiao, and K. V. Subrahmanyam. 2018. Constructive non-commutative rank computation is in deterministic polynomial time. Computational Complexity, 27, 4 (2018), 561–593. issn:1420-8954 https://doi.org/10.1007/s00037-018-0165-7
[31]
Pushkar S. Joglekar. 2023. Personal Communication.
[32]
Valentine Kabanets and Russell Impagliazzo. 2004. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Comput. Complex., 13, 1-2 (2004), 1–46. https://doi.org/10.1007/s00037-004-0182-6
[33]
T.Y. Lam. 2001. A First Course in Noncommutative Rings (Second Edition).
[34]
Visu Makam and Avi Wigderson. 2019. Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties). Journal für die reine und angewandte Mathematik (Crelles Journal), 2021 (2019), 79 – 131.
[35]
Richard S. Pierce. 1982. Associative Algebras. Springer-Verlag.
[36]
Louis Halle Rowen. 1980. Polynomial identities in ring theory. Academic Press.
[37]
Jacob T. Schwartz. 1980. Fast Probabilistic algorithm for verification of polynomial identities. J. ACM., 27, 4 (1980), 701–717.
[38]
Volker Strassen. 1973. Vermeidung von Divisionen. Journal für die reine und angewandte Mathematik, 264 (1973), 184–202.
[39]
Jurij Volčič. 2018. Matrix coefficient realization theory of noncommutative rational functions. Journal of Algebra, 499 (2018), 04, 397–437. https://doi.org/10.1016/j.jalgebra.2017.12.009
[40]
Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation, EUROSAM ’79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings, Edward W. Ng (Ed.) (Lecture Notes in Computer Science, Vol. 72). Springer, Marseille, France. 216–226. https://doi.org/10.1007/3-540-09519-5_73
Index Terms
- Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
Recommendations
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
CCC '21: Proceedings of the 36th Computational Complexity ConferencePolynomial Identity Testing (PIT) is a fundamental computational problem. The famous depth-4 reduction (Agrawal & Vinay, FOCS'08) has made PIT for depth-4 circuits, an enticing pursuit. The largely open special-cases of sum-product-of-sum-of-univariates ...
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceWe study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an efficient, deterministic, white-box polynomial ...
Derandomizing polynomial identity tests means proving circuit lower bounds
We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or even nondeterministic subexponential time, ...
Comments
Information & Contributors
Information
Published In
June 2024
2049 pages
ISBN:9798400703836
DOI:10.1145/3618260
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
STOC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)3
Reflects downloads up to 12 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in