Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe strong approximation theorem and computing with linear groups
123
0
0.0
(
0
)
Added by
Alla Detinko
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H leq mathrm{SL}(n, mathbb{Z})$ for $n geq 2$. More generally, we are able to compute all congruence quotients of a finitely generated Zariski dense subgroup of $mathrm{SL}(n, mathbb{Q})$ for $n > 2$.
rate research
Read More
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}.
In 1878, Jordan showed that a finite subgroup of GL(n,C) contains an abelian normal subgroup whose index is bounded by a function of n alone. Previously, the author has given precise bounds. Here, we consider analogues for finite linear groups over algebraically closed fields of positive characteristic l. A larger normal subgroup must be taken, to eliminate unipotent subgroups and groups of Lie type and characteristic l, and we show that generically the bound is similar to that in characteristic 0 - being (n+1)!, or (n+2)! when l divides (n+2) - given by the faithful representations of minimal degree of the symmetric groups. A complete answer for the optimal bounds is given for all degrees n and every characteristic l.
A valuated group with normal forms is a group with an integer-valued length function satisfying some Lyndons axioms and an additional axiom considered by Hurley. We prove a subgroup theorem for valuated groups with normal forms analogous to Grushko-Neumanns theorem. We study also the CSA property in such groups.
We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.
For $n > 2$, let $Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $Hleq Gamma$. This forms the main component of our methods for computing with such arithmetic groups $H$. More generally, we provide algorithms for computing with Zariski dense groups in $Gamma$. We use our GAP implementation of the algorithms to solve problems that have emerged recently for important classes of linear groups.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
