Related papers: On 3-generated 6-transposition groups

We prove that, for $g\geq19$ the mapping class group of a nonorientable surface of genus $g$, $\textrm{Mod}(N_g)$, can be generated by two elements, one of which is of order $g$. We also prove that for $g\geq26$, $\textrm{Mod}(N_g)$ can be…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is…

A group $G$ is invariably generated if there exists a subset $S \subseteq G$ such that, for every choice $g_s \in G$ for $s \in S$, the group $G$ is generated by $\{ s^{g_s} \mid s \in S \}$. In [GGJ16] Gelander, Golan and Juschenko showed…

Let $G$ be a finite group and $H$ be a subgroup of $G$. In this paper, we prove that if $G$ is a finite nilpotent group and $H$ a subgroup of $G$, then $H$ is normal in $G$ if and only if all normalized right transversals of $H$ in $G$ are…

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…

As defined by Guralnick and Saxl given a nonabelian simple group $S$ and its nonidentity automorphism $x$, a natural number $\alpha_S(x)$ does not exceed a natural number $m$ if some $m$ conjugates of $x$ in the group $\langle x,S\rangle$…

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

Automorphisms of order $2$ are studied in order to understand generalized symmetric spaces. The groups of type $E_6$ we consider here can be realized as both the group of linear maps that leave a certain determinant invariant, and also as…

We determine the commutative Schur rings over $S_6$ that contain the sum of all the transpositions in $S_6$. There are eight such types (up to conjugacy), of which four have the set of all the transpositions as a principal set of the Schur…

Let $S_g$ be the closed oriented surface of genus g and let $\text{Mod}(S_g)$ be the mapping class group. When the genus is at least 3, $\text{Mod}(S_g)$ can be generated by torsion elements. We prove the follow results. For $g \geq 4$,…

This paper concerns finite groups of class (at most) two and of odd prime exponent $p$. Such a group is called special if the center lies within its derived group. Every group of class 2 and exponent $p$ can be uniquely expressed as the…

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

We show that the mapping class group of a closed oriented surface of genus at least three is generated by 3 elements of order 3 and by 4 elements of order 4. Note that the mapping class group cannot be generated by finitely many torsion…

We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…