Constructive Membership Tests in Some Infinite Matrix Groups
classification
🧮 math.GR
keywords
elementslengthsproductsalgorithmsallowarbitrarycompetitiveconstructive
read the original abstract
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.