Constructive Membership Tests in Some Infinite Matrix Groups

Autor:	Alexander Hulpke
Rok vydání:	2018
Předmět:	20G35 68W05 Symplectic group 010102 general mathematics Group Theory (math.GR) 010103 numerical & computational mathematics 01 natural sciences Constructive Algebra Matrix group Factorization Product (mathematics) FOS: Mathematics 0101 mathematics Heuristics Mathematics - Group Theory Mathematics
Zdroj:	ISSAC
DOI:	10.1145/3208976.3208983
Popis:	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. Comment: ISSAC 2018
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f114f56ce47354656e6e5dd33b5cce2 https://doi.org/10.1145/3208976.3208983 Zobrazit plný text záznamu