Related papers: Generating minimally transitive permutation groups

Let $k_r(n,\delta)$ be the minimum number of $r$-cliques in graphs with $n$ vertices and minimum degree $\delta$. We evaluate $k_r(n,\delta)$ for $\delta \leq 4n/5$ and some other cases. Moreover, we give a construction, which we conjecture…

We establish an explicit upper bound B(p,l,m), depending on p,l,m, on the number of conjugacy classes of order p^2 torsion elements u of type <l,m> of the Nottingham group defined over the prime field of characteristic p >0. In the cases…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

Let $V,W$ be representations of a cyclic group $G$ of prime order $p$ over a field $k$ of characteristic $p$. The module of covariants $k[V,W]^G$ is the set of $G$-equivariant polynomial maps $V \rightarrow W$, and is a module over…

We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing…

Let $G$ be a finite permutation group on a finite set $\Omega$. The notion of $G$ being quasi-transitive on $\Omega$ was defined by Alan Camina \cite{Camina}; in that paper conditions were established that ensured a quasi-transitive group…

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 this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group. We show that there is a finite group with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$ and we indicate…

A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length $n$ and minimum distance $n-1$. When such codes of length $p+1$ are included as…

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

We prove that a finite $3$-group in the Cremona group $\mathrm{Cr}_3(\mathbb{C})$ can be generated by at most $4$ elements. This provides the last missing piece in bounding the ranks of finite $p$-subgroups in the space Cremona group.

We completely elucidate the relationship between two invariants associated with an ergodic probability measure-preserving (pmp) equivalence relation, namely its cost and the minimal number of topological generators of its full group. It…

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least integer $n$ such that $G$ is isomorphic to a subgroup of the symmetric group $S_n$. If $G$ has a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$, then $G$…

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…