A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results
Abstract: We study the noncommutative rank problem, ncRANK, of computing the rank of matrices with linear entries in $n$ noncommuting variables and the problem of noncommutative Rational Identity Testing, RIT, which is to decide if a given rational formula in $n$ noncommuting variables is zero on its domain of definition. Motivated by the question whether these problems have deterministic NC algorithms, we revisit their interrelationship from a parallel complexity point of view. We show the following results: 1. Based on Cohn's embedding theorem \cite{Co90,Cohnfir} we show deterministic NC reductions from multivariate ncRANK to bivariate ncRANK and from multivariate RIT to bivariate RIT. 2. We obtain a deterministic NC-Turing reduction from bivariate $\RIT$ to bivariate ncRANK, thereby proving that a deterministic NC algorithm for bivariate ncRANK would imply that both multivariate RIT and multivariate ncRANK are in deterministic NC.
- S. A. Amitsur. Rational identities and applications to algebra and geometry. Journal of Algebra, 3:304–359, 1966.
- Black-box identity testing of noncommutative rational formulas in deterministic quasipolynomial time. CoRR, abs/2309.1564, 2023. In STOC 2024, to appear.
- Trading determinism for noncommutativity in Edmonds’ problem. CoRR, abs/2404.07986, 2024.
- Randomized polynomial-time identity testing for noncommutative circuits. Theory Comput., 15:1–36, 2019.
- G. M. Bergman. Skew fields of noncommutative rational functions, after Amitsur. Sé Schü–Lentin–Nivat, Paris, 1970.
- A deterministic PTAS for the commutative rank of matrix spaces. Theory Comput., 14(1):1–21, 2018.
- More on noncommutative polynomial identity testing. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pages 92–99, 2005.
- Richard P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201–206, 1974.
- The noncommutative edmonds’ problem re-visited. CoRR, abs/2305.09984, 2023.
- P. M. Cohn. The embedding of fir in skew fields. Proceedings of the London Mathematical Society, 23:193–213, 1971.
- P. M. Cohn. Universal skew fields of fractions. Sympos. Math., 8:135–148, 1972.
- P. M. Cohn. Free Rings and their Relations. London Mathematical Society Monographs. Academic Press, 1985.
- P. M. Cohn. An embedding theorem for free associative algebras. Mathematica Pannonica, 1(1):49–56, 1990.
- P. M. Cohn. Introduction to Ring Theory. Springer, 2000.
- P. M. Cohn. Free Ideal Rings and Localization in General Rings. New Mathematical Monographs. Cambridge University Press, 2006.
- A probabilistic remark on algebraic program testing. Inf. Process. Lett., 7(4):193–195, 1978.
- Polynomial degree bounds for matrix semi-invariants. CoRR, abs/1512.03393, 2015.
- A deterministic polynomial time algorithm for non-commutative rational identity testing. CoRR, abs/1511.03730, 2015.
- Operator scaling: Theory and applications. Found. Comput. Math., 20(2):223–290, 2020.
- Graham Higman. The units of group-rings. Proceedings of the London Mathematical Society, s2-46(1):231–248, 1940.
- Non-commutative arithmetic circuits with division. Theory Comput., 11:357–393, 2015.
- Non-commutative edmonds’ problem and matrix semi-invariants. Comput. Complex., 26(3):717–763, 2017.
- Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex., 27(4):561–593, 2018.
- Noam Nisan. Lower bounds for non-commutative computation (extended abstract). In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pages 410–418. ACM, 1991.
- Sanguthevar Rajasekaran and John H. Reif, editors. Handbook of Parallel Computing - Models, Algorithms and Applications. Chapman and Hall/CRC, 2007.
- Deterministic polynomial identity testing in non-commutative models. Comput. Complex., 14(1):1–19, 2005.
- L. H. Rowen. Polynomial identities in ring theory, Pure and Applied Mathematics. Academic Press Inc., Harcourt Brace Jovanovich Publishers, New York, 1980.
- Jacob T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(4):701–717, 1980.
- James C. Wyllie. Complexity of Parallel Computation, PhD Thesis. Cornell University, 1979.
- Richard Zippel. Probabilistic algorithms for sparse polynomials. In Edward W. Ng, editor, Symbolic and Algebraic Computation, EUROSAM ’79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings, volume 72 of Lecture Notes in Computer Science, pages 216–226. Springer, 1979.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
