Abstract
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group G is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of G. We also provide a simple new algorithm for integrality testing of finitely generated solvable-by-finite linear groups over the rational field. The algorithms have been implemented in Magma.
| Original language | English |
|---|---|
| Pages (from-to) | 138-145 |
| Number of pages | 8 |
| Journal | Journal of Symbolic Computation |
| Volume | 68 |
| Issue number | P1 |
| DOIs | |
| Publication status | Published - 1 May 2015 |
Keywords
- Algebraic group
- Algorithm
- Arithmetic group
- Lattice
Fingerprint
Dive into the research topics of 'Integrality and arithmeticity of solvable linear groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver