Related papers: Sharp upper bounds on the minimal number of elemen…

A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…

A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…

We prove that the mapping class group of a closed connected orientable surface of genus $g$ is generated by two elements of order $g$ for $g\geq 6$. Moreover, for $g\geq 7$ we found a generating set of two elements, of order $g$ and $g'$…

Let $G$ be a nontrivial permutation group of degree $n$. If $G$ is transitive, then a theorem of Jordan states that $G$ has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If $G$ is…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that…

The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…

Let $N_g$ be the non-orientable surface with genus $g$, $\text{MCG}(N_g)$ be the mapping class group of $N_g$, $\mathcal{T}(N_g)$ be the index 2 subgroup generated by all Dehn twists of $\text{MCG}(N_g)$. We prove that for odd genus,…

A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissociation sets. In this paper, it is shown that for $n\geq 3$,…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the…

In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.

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 $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…

Let $n$ be a positive integer divisible by 8. The Clifford-cyclotomic gate set $\mathcal{G}_n$ consists of the Clifford gates, together with a $z$-rotation of order $n$. It is easy to show that, if a circuit over $\mathcal{G}_n$ represents…

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

We prove that if $G$ is a transitive permutation group of sufficiently large degree $n$, then either $G$ is primitive and Frobenius, or the proportion of derangements in $G$ is larger than $1/(2n^{1/2})$. This is sharp, generalizes…

The group U_n(F) of all nxn unipotent upper-triangular matrices over F has derived length d := Ceiling(log_2 (n)), equivalently 2^{d-1} < n <= 2^d. We prove that U_n(F) has a 3-generated subgroup of derived length d, and it has a…

Let $N_g$ be a closed, connected, nonorientable surface of genus $g$. We prove that for $g \ge 13$, the mapping class group $\text{Mod}(N_g)$ can be generated by exactly two elements. This improves the previously known bound of $g \ge 19$.