Back to Search
Start Over
Integrality and arithmeticity of solvable linear groups
- Publication Year :
- 2019
-
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}.
- Subjects :
- FOS: Computer and information sciences
Computer Science - Symbolic Computation
Field (mathematics)
Group Theory (math.GR)
Symbolic Computation (cs.SC)
Lattice (discrete subgroup)
Algebraic group
Combinatorics
Borel subgroup
Solvable group
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
FOS: Mathematics
Mathematics
Discrete mathematics
20-04, 20G15, 20H25, 68W30
Arithmetic group
Algebra and Number Theory
Algorithm
Lattice
Computational Mathematics
Stallings theorem about ends of groups
Generating set of a group
Mathematics - Group Theory
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....aa5a54b845683f047f7d52059a9a0bc3