Related papers: Generators for Arithmetic Groups

For a number field K, we show that any S-arithmetic subgroup of SL_2(K) contains a subgroup of finite index generated by three elements if card(S)> 1.

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

We study several explicit finite index subgroups in the known complex hyperbolic lattice triangle groups, and show some of them are neat, some of them have positive first Betti number, some of them have a homomorphisms onto a non-Abelian…

We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

We show that cocompact lattices in rank one simple Lie groups of non-compact type distinct from SO(2m,1) (m>0) contain surface subgroups.

The following results are proved: The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

In this paper, we finished the classification of three-generator finite $p$-groups $G$ such that $\Phi(G)\le Z(G)$. This paper is a part of classification of finite $p$-groups with a minimal non-abelian subgroup of index $p$, and partly…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

We establish three independent results on groups acting on trees. The first implies that a compactly generated locally compact group which acts continuously on a locally finite tree with nilpotent local action and no global fixed point is…

We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.

It was conjectured in [KLS14] that for arithmetic groups, Invariable Generation is equivalent to the Congruence Subgroup Property. In view of the famous Serre conjecture this would imply that higher rank arithmetic groups are invariably…

This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…

Let L be a lattice in a connected Lie group. We show that besides a few exceptional cases, the deficiency of L is nonpositive.

For most (and possibly all) non-associative finite simple Moufang loops, three generators of order 3 can be chosen so that each two of them generate a group isomorphic to $(3, 3 | 3, p)$. The subgroup structure of $(3, 3 | 3, p)$ depends on…

We describe a systematic method to construct arbitrary highest-weight modules, including arbitrary finite-dimensional representations, for any finite dimensional simple Lie algebra $\mathfrak{g}$. The Lie algebra generators are represented…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.