Related papers: Minimal generation of transitive permutation group…
In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…
We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.
In this short note we prove that, if $p$ is an odd prime dividing the order of a sporadic simple group, then with the exception of four groups for $p=3$, all sporadic simple groups are generated by an involution and an element of order $p$.
We show that for every $1 \le k \le d/(\log d)^C$, every finite transitive set of unit vectors in $\mathbb{R}^d$ lies within distance $O(1/\sqrt{\log (d/k)})$ of some codimension $k$ subspace, and this distance bound is best possible. This…
The mapping class group of an orientable surface, which records its symmetries up to isotopy, plays a central role in low-dimensional topology. This chapter explores the foundational problem of determining minimal generating sets for these…
The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…
We investigate properties of finite transitive permutation groups $(G, \Omega)$ in which all proper subgroups of $G$ act intransitively on $\Omega.$ In particular, we are interested in reduction theorems for minimally transitive…
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 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'$…
The minimal base size $b(G)$ for a permutation group $G$, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that $b(G)\leq 2$ for coprime linear groups. Motivated by this result and the probabilistic…
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…
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…
Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the…
For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\geq d$ for every maximum matching $M$ of $G$. The $d$-transversal number of $G$, denoted by $\tau_d(G)$, is the…
We prove that the action of the semigroup generated by a $C^r$ generic pair of area-preserving diffeomorphisms of a compact orientable surface is transitive.
The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2.…