Subgroup Membership in GL(2,Z)

It is shown that the subgroup membership problem for a virtually free group can be decided in polynomial time when all group elements are represented by so-called power words, i.e., words of the form p 1 z 1 p 2 z 2 ⋯ p k z k . Here the p i are explicit words over the generating set of the group and all z i are binary encoded integers. As a corollary, it follows that the subgroup membership problem for the matrix group GL ( 2 , Z ) can be decided in polynomial time when elements of GL ( 2 , Z ) are represented by matrices with binary encoded integers. For the same input representation, it also shown that one can compute in polynomial time the index of a given finitely generated subgroup of GL ( 2 , Z ) .