Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userIntegrality and arithmeticity of solvable linear groups
244
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 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}.
rate research
Read More
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$.
In this note, we announce the first results on quasi-isometric rigidity of non-nilpotent polycyclic groups. In particular, we prove that any group quasi-isometric to the three dimenionsional solvable Lie group Sol is virtually a lattice in Sol. We prove analogous results for groups quasi-isometric to $R ltimes R^n$ where the semidirect product is defined by a diagonalizable matrix of determinant one with no eigenvalues on the unit circle. Our approach to these problems is to first classify all self quasi-isometries of the solvable Lie group. Our classification of self quasi-isometries for $R ltimes R^n$ proves a conjecture made by Farb and Mosher in [FM4]. Our techniques for studying quasi-isometries extend to some other classes of groups and spaces. In particular, we characterize groups quasi-isometric to any lamplighter group, answering a question of de la Harpe [dlH]. Also, we prove that certain Diestel-Leader graphs are not quasi-isometric to any finitely generated group, verifying a conjecture of Diestel and Leader from [DL] and answering a question of Woess from [SW],[Wo1]. We also prove that certain non-unimodular, non-hyperbolic solvable Lie groups are not quasi-isometric to finitely generated groups. The results in this paper are contributions to Gromovs program for classifying finitely generated groups up to quasi-isometry [Gr2]. We introduce a new technique for studying quasi-isometries, which we refer to as coarse differentiation.
It is shown that a closed solvable subgroup of a connected Lie group is compactly generated. In particular, every discrete solvable subgroup of a connected Lie group is finitely generated. Generalizations to locally compact groups are discussed as far as they carry.
Recent papers of the authors have completely described the hyperbolic actions of several families of classically studied solvable groups. A key tool for these investigations is the machinery of confining subsets of Caprace, Cornulier, Monod, and Tessera, which applies, in particular, to solvable groups with virtually cyclic abelianizations. In this paper, we extend this machinery and give a correspondence between the hyperbolic actions of certain solvable groups with higher rank abelianizations and confining subsets of these more general groups. We then apply this extension to give a complete description of the hyperbolic actions of a family of groups related to Baumslag-Solitar groups.
For an element in $BS(1,n) = langle t,a | tat^{-1} = a^n rangle$ written in the normal form $t^{-u}a^vt^w$ with $u,w geq 0$ and $v in mathbb{Z}$, we exhibit a geodesic word representing the element and give a formula for its word length with respect to the generating set ${t,a}$. Using this word length formula, we prove that there are sets of elements of positive density of positive, negative and zero conjugation curvature, as defined by Bar Natan, Duchin and Kropholler.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
