The complexity of the membership problem for 2-generated commutative semigroups of rational matrices

We present a deterministic polynomial-time algorithm for the ABC 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.<<ETX>>

[1]  V. M. Kopytov,et al.  Solvability of the problem of occurrence in finitely generated soluble groups of matrices over the field of algebraic numbers , 1968 .

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

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

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

[5]  László Babai,et al.  Fast Monte Carlo algorithms for permutation groups , 1991, STOC '91.

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

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

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

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

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

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

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

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

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

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

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

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

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

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