Related papers: Generating minimally transitive permutation groups

We obtain a sharp bound for p-elementary subgroups in the plane Cremona group over an arbitrary perfect field.

A general method for calculating or constructing lower central factors of groups is presented. {\it Relative basic commutators} are defined.

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group and recall that an element in $G$ is a derangement if it has no fixed points on $\Omega$. Let $\Delta(G)$ be the set of derangements in $G$ and define $\delta(G) =…

We introduce a technique for proving lower bounds on the essential dimension of split reductive groups. As an application, we strengthen the best previously known lower bounds for various split simple algebraic groups, most notably for the…

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Let $\Sigma_{g,b}$ denote a closed oriented surface genus $g$ with $b$ punctures and let $Mod_{g,b}$ denote its mapping class group. Luo proved that if the genus is at least 3, the group $Mod_{g,b}$ is generated by involutions. He also…

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…

We establish upper and lower bounds on the maximal number of steps needed to transform a cyclic permutation to the canonical cyclic permutation using conjugation by adjacent transpositions, and on the diameter of the underlying Schreier…

We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…

In this paper we prove the existence of minimal non uniquely ergodic flipped IETs. In particular, we build explicitly minimal non uniquely ergodic $(10,k)$-IETs for any $1\leq k \leq 10$. This answers an open question posed in…

Let $\Gamma$ be a group acting on a set $X$. The distinguishing number for this action of $\Gamma$ on $X$, denoted by $D_{\Gamma}(X)$, is the smallest natural number $k$ such that the elements of $X$ can be labeled with $k$ labels so that…

A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…

A transitive group $G$ of permutations of a set $\Omega$ is primitive if the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. If $\alpha \in \Omega$, then the orbits of the stabiliser $G_\alpha$…

We improve on recent estimates for the probability of generating the alternating and symmetric groups $\mathrm{Alt}(n)$ and $\mathrm{Sym}(n)$. In particular we find the sharp lower bound, if the probability is given by a quadratic in…

We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group.…

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups,…

The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…