Integrality and arithmeticity of solvable linear groups
classification
🧮 math.GR
cs.SC
keywords
algorithmarithmeticfinitelygeneratedgroupsintegralitylinearsolvable
read the original 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 {\sc Magma}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.