Related papers: Minimal generation of transitive permutation group…

Let $\textrm{Mod}(N_{g, p})$ denote the mapping class group of a nonorientable surface of genus $g$ with $p$ punctures. For $g\geq14$, we show that $\textrm{Mod}(N_{g, p})$ can be generated by five elements or by six involutions.

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

Let $\mathcal C$ be a set of finite groups which is closed under taking subgroups and let $d$ and $M$ be positive integers. Suppose that for any $G\in\mathcal C$ whose order is divisible by at most two distinct primes there exists an…

A natural generating set for a Galois extension regarded as the splitting field of an irreducible polynomial is introduced and investigated here. Minimal generating sets arising in this context throw many surprises compared to the analogous…

A group is called capable if it is a central factor group. For each prime $p$ and positive integer $c$, we prove the existence of a capable $p$-group of class $c$ minimally generated by an element of order $p$ and an element of order…

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a…

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

We define a cipher that is an extension of GOST, and study the permutation group generated by its round functions. We show that, under minimal assumptions on the components of the cipher, this group is the alternating group on the plaintext…

For a finite group $G,$ $\mathsf{D}(G)$ is defined as the least positive integer $k$ such that for every sequence $S=g_1\bdot g_2\bdot \dotsc \bdot g_k$ of length $k$ over $G$, there exist $1 \le i_1 < i_2 <\cdots < i_m \le k $ such that…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

In \cite{striker2018rowmotion} Striker generalized Cameron and Fon-Der-Flaass's notion of a toggle group. In this paper we begin the study of transitive generalized toggle groups that contain a cycle. We first show that if such a group has…

We study Cartesian decompositions of sets that are acted upon intransitively by innately transitive permutation groups. We prove that such groups have at most three orbits on such a decomposition. A consequence of this result is that if $G$…

Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

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$,…