Constructive membership tests in some infinite matrix groups

DOI10.1145/3208976.3208983MaRDI QIDQ5120199zbMATH OpenOpenAlexWikidataFDO

Authors A. Hulpke

Publication date 9 September 2020

Published in Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.09188

zbMATH Keywords

factorizationlinear groupssymplectic groupwords

Mathematics Subject Classification ID

Linear algebraic groups over adèles and other rings and schemes (20G35) Nonnumerical algorithms (68W05)

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.

Recommendations

• scientific article; zbMATH DE number 1004928
• On the membership problem for some subgroups of \(SL_2(\mathbf{Z})\)
• A criterion for occurrence in a subgroup generated by two-dimensional elementary matrices
• The computational matrix group project.
• On two-generator subgroups in \(\mathrm{SL}_2(\mathbb{Z})\), \(\mathrm{SL}_2(\mathbb{Q})\), and \(\mathrm{SL}_2(\mathbb{R})\)

Cited in

(4)

• Testing polycyclicity of finitely generated rational matrix groups
• Proving infinite index for a subgroup of matrices
• Experimenting with Symplectic Hypergeometric Monodromy Groups
• A criterion for occurrence in a subgroup generated by two-dimensional elementary matrices

This page was built for publication: Constructive membership tests in some infinite matrix groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120199)