Related papers: Sieve methods in group theory I: Powers in Linear …

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

In this paper, we investigate finitely generated groups of isometries of CAT(0) spaces containing some central hyperbolic isometry, and study CAT(0) groups. We show that every CAT(0) group $\Gamma$ has the semi-direct product structure…

We extend Lie's classical method for finding group invariant solutions to the case of non-transverse group actions. For this extension of Lie's method we identify a local obstruction to the principle of symmetric criticality. Two examples…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

There are many Lie groups used in physics, including the Lorentz group of special relativity, the spin groups (relativistic and non-relativistic) and the gauge groups of quantum electrodynamics and the weak and strong nuclear forces.…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

Let $\Gamma$ be a non-commutative free group on finitely many generators. In a previous work two of the authors have constructed the class of multiplicative representations of $\Gamma$ and proved them irreducible as representation of…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Let us consider a linear control system \Sigma on a connected Lie group G. It is known that the accessibility set A from the identity e is in general not a semigroup. In this article we associate a new algebraic object S to \Sigma which…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

This paper deals with the classification of groups $G$ such that power graphs and proper power graphs of $G$ are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all…

We fix a field $\kk$ of characteristic $p$. For a finite group $G$ denote by $\delta(G)$ and $\sigma(G)$ respectively the minimal number $d$, such that for any finite dimensional representation $V$ of $G$ over $\kk$ and any $v\in…

A finite group $G$ is called $\psi$-divisible if $\psi(H)|\psi(G)$ for any subgroup $H$ of $G$, where $\psi(H)$ and $\psi(G)$ are the sum of element orders of $H$ and $G$, respectively. In this paper, we extend a result provided in [10], by…