New algorithms for testing nilpotency and answering structural questions about nilpotent matrix groups over infinite fields are developed and implemented in GAP and MAGMA.
Segal, Polycyclic groups, Cambridge Tracts in Mathematics, vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Algorithms for computing with nilpotent matrix groups over infinite domains
New algorithms for testing nilpotency and answering structural questions about nilpotent matrix groups over infinite fields are developed and implemented in GAP and MAGMA.