Constructive Membership Tests in Some Infinite Matrix Groups

Abstract

We describe algorithms and heuristics that allow us to express arbitrary elements of SLn(Z) and Sp 2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it produces product expressions whose lengths are competitive with the input lengths. This is the author's copy of https://doi.