Related papers: A Note On Transversals

We show that if $M$ is a compact oriented surface of genus 0 and $G$ is a subgroup of $\Symp^\omega_\mu(M)$ which has an infinite normal solvable subgroup, then $G$ is virtually abelian. In particular the centralizer of an infinite order $f…

Let $G$ be a group and write $\mbox{Perm}(G)$ for its symmetric group. Define $\mbox{Hol}(G)$ to be the holomorph of $G$, regarded as a subgroup of $\mbox{Perm}(G)$, and let $\mbox{NHol}(G)$ denote its normalizer. The quotient $T(G) =…

In this paper we prove that any strongly embedded subgroup of a K*-group G of finite Morley rank and odd type that does not interpret any bad field is solvable if its Pruefer 2-rank is at least 2. If the normal 2-rank of G is at least 3…

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…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

Suppose that G is a discrete abelian group and A is a finite symmetric subset of G. We show two main results. i) Either there is a set H of O(log^c|A|) subgroups of G with |A \triangle \bigcup H| = o(|A|), or there is a character X on G…

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

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…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

Let $G$ and $H$ be groups that act compatibly on each other. We denote by $[G,H]$ the derivative subgroup of $G$ under $H$. We prove that if the set $\{g^{-1}g^h \mid g \in G, h \in H\}$ has $m$ elements, then the derivative $[G,H]$ is…

Given a finite group $G$. The generating pair $(H,a)$ of $G$, that is, $H<G$ and $a\in G$ such that $\langle a,H\rangle=G$. In this paper, we introduce the definition of FF-subgroup to characterize the generating pairs of the symmetric…

In this paper we first give a necessary and sufficient condition for a group $G$ generated by $n$ elements to be a square commutative group and prove $G$ is a square commutative group if and only if $\widehat{G}$ is an abelian group, then…

Let $S$ be either a free group or the fundamental group of a closed hyperbolic surface. We show that if $G$ is a finitely generated residually-$p$ group with the same pro-$p$ completion as $S$, then two-generated subgroups of $G$ are free.…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

A question of interest both in Hopf-Galois theory and in the theory of skew braces is whether the holomorph $\mathrm{Hol(N)}$ of a finite soluble group $N$ can contain an insoluble regular subgroup. We investigate the more general problem…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

A subgroup $H$ of a group $G$ is said to be a TNI-subgroup if $N_{G}(H)\cap H^g=1$ for any $g\in G\,\backslash \,N_{G}(H).$ Let $A$ be an abelian group acting coprimely on the finite group $G$ by automorphisms in such a way that…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…