Paper Info
Title
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 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.
Year
DOI
Venue
2018
10.1145/3208976.3208983
ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION
Keywords
Field
DocType
Linear Groups, Symplectic Group, Factorization, Words
Discrete mathematics,Algebra,Expression (mathematics),Constructive,Symplectic group,Heuristics,Factorization,Mathematics,Matrix group
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
1
Name
Order
Citations
PageRank
Alexander Hulpke1649.89