The Complexity of the A B C Problem

We present a deterministic polynomial-time algorithm for the A B C problem, which is the membership problem for 2-generated commutative linear semigroups over an algebraic number field. We also obtain a polynomial-time algorithm for the (easier) membership problem for 2-generated abelian linear groups. Furthermore, we provide a polynomial-sized encoding for the set of all solutions.

[1]  Eugene M. Luks,et al.  Computing in solvable matrix groups , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[2]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  M. Paterson.  Unsolvability in 3 × 3 Matrices , 1970 .

[4]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[5]  Richard J. Lipton,et al.  The complexity of the membership problem for 2-generated commutative semigroups of rational matrices , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

[7]  Guoqiang Ge.  Testing equalities of multiplicative representations in polynomial time , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[8]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[9]  Yechezkel Zalcstein,et al.  The Complexity of Grigorchuk Groups with Application to Cryptography , 1991, Theor. Comput. Sci..

[10]  László Babai,et al.  Permutation groups in NC , 1987, STOC '87.

[11]  Michael O. Rabin,et al.  Recursive Unsolvability of Group Theoretic Problems , 1958 .

[12]  László Babai,et al.  Las Vegas algorithms for matrix groups , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[13]  D. W. Masser.  New Advances in Transcendence Theory: Linear relations on algebraic groups , 1988 .

[14]  Mario Curzio,et al.  Su di un problema combinatorio in teoria dei gruppi , 1983 .

[15]  Jin-Yi Cai,et al.  Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time , 1994, Int. J. Found. Comput. Sci..

[16]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[17]  Richard J. Lipton,et al.  The orbit problem is decidable , 1980, STOC '80.

[18]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[19]  Hugh L. Montgomery,et al.  Algebraic integers near the unit circle , 1971 .

[20]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[21]  László Babai,et al.  Fast Monte Carlo Algorithms for Permutation Groups , 1995, J. Comput. Syst. Sci..

[22]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[23]  Jin-Yi Cai,et al.  Multiplicative equations over commuting matrices , 1996, SODA '96.

[24]  William W. Boone.  The Word Problem , 1959 .

[25]  M. Garzon,et al.  On permutation properties in groups and semigroups , 1986 .

[26]  Pascal Weil,et al.  PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups , 1994, ICALP.

[27]  Ravindran Kannan.  The size of numbers in the analysis of certain algorithms , 1980 .

[28]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[29]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[30]  Martin Beaudry.  Membership Testing in Commutative Transformation Semigroups , 1988, Inf. Comput..

[31]  Irving Kaplansky,et al.  Fields and rings , 1969 .

[32]  R. Grigorchuk.  Degrees of Growth of Finitely Generated Groups, and the Theory of Invariant Means , 1985 .