Related papers: The $3$-closure of a solvable permutation group is…

Not any nonsingular equation over a metabelian group has solution in a larger metabelian group. However, any nonsingular equation over a solvable group with a subnormal series with abelian torsion-free quotients has a solution in a larger…

Let $\Gamma_g$ denote the orientation-preserving Mapping Class Group of the genus $g\geq 1$ closed orientable surface. In this paper we show that for fixed $g$, every finite group occurs as a quotient of a finite index subgroup of…

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…

For a finite group $G$ denote by $N(G)$ the set of conjugesy class sizes of $G$. We show that every finite group $G$ with the property $N(G)=N(Alt_n), n>4$ or $N(G)=N(Sym_n), n>22$ is non-solvable.

Let $X$ be a compact Riemann surface of genus $g\geq 2$. Let $Aut(X)$ be its group of automorphisms and $G\subseteq Aut(X)$ a subgroup. Sharp upper bounds for $|G|$ in terms of $g$ are known if $G$ belongs to certain classes of groups, e.g.…

Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.

It is shown that if $G$ is a primitive permutation group on a set of size $n$, then any nilpotent quotient of $G$ has order at most $n^{\beta}$ and any solvable quotient of $G$ has order at most $n^{\alpha+1}$ where $\beta=\log 32/ \log 9$…

The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…

We prove that every \omega-categorical, generically stable group is nilpotent-by-finite and that every \omega-categorical, generically stable ring is nilpotent-by-finite.

A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…

Consider a countable group Gamma acting ergodically by measure preserving transformations on a probability space (X,mu), and let R_Gamma be the corresponding orbit equivalence relation on X. The following rigidity phenomenon is shown: there…

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…

Let $G$ be a finite group and $p$ a fixed prime divisor of $|G|$. Combining the nilpotence, the normality and the order of groups together, we prove that if every maximal subgroup of $G$ is nilpotent or normal or has $p'$-order, then (1)…

Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of…

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

A. Smoktunowicz and L. Vendramin conjectured that if $A$ is a finite skew brace with solvable additive group, then the multiplicative group of $A$ is solvable. In this short note we make a step towards positive solution of this conjecture…

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…