From nobody Mon Mar 4 14:24 EST 1996 Date: Mon, 4 Mar 1996 14:24:32 -0500 (EST) From: uid no body To: techreps@cs.buffalo.edu Subject: techrep: POST request Content-Type: text Content-Length: 380 ContactPerson: cai@cs.buffalo.edu Remote host: bach.cs.buffalo.edu Remote ident: cai ### Begin Citation ### Do not delete this line ### %R 96-01 %U /u4/csstaff/milun/ig-12-20.ps %A Ivanyos, Gábor %T Testing membership in unitriangular matrix groups. Preliminary draft %D January 02, 1996 %I Department of Computer Science, SUNY Buffalo %X We present an algorithm that, given a subgroup G of the group of the upper triangular matrices with rational entries by a set of generators, computes generators of the lower central series of G. As an application, we show that the constructive membership problem in G can be performed in polynomial time. This draft is intended to be part of a larger project investigating the complexity of computational problems in finitely generated linear groups.