Related papers: Quasiprimitive groups containing a transitive alte…

We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.

We present a representation for permutation groups as the automorphism group of an ordered set $U$ such that the automorphism group's action on a subset $T\subseteq U$ is the permutation group itself. For many imprimitive permutation…

The blow-up construction by L. G. Kov\'acs has been a very useful tool to study embeddings of finite primitive permutation groups into wreath products in product action. In the present paper we extend the concept of a blow-up to finite…

Let $H$ and $B$ be subgroups of a finite group $G$ such that $G=N_{G}(H)B$. Then we say that $H$ is \emph{quasipermutable} (respectively \emph{$S$-quasipermutable}) in $G$ provided $H$ permutes with $B$ and with every subgroup (respectively…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

In this paper we characterize permutation groups that are automorphism groups of coloured graphs and digraphs and are abelian as abstract groups. This is done in terms of basic permutation group properties. Using Schur's classical…

We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…

In this article, we define quasiprimitive quandles and describe them with the help of quasiprimitive permutation groups. As a consequence, we enumerate finite non-affine simple quandles up to order $4096$.

Let $\text{Homeo}_{+}(\mathbb{S}^1)$ denote the group of orientation preserving homeomorphisms of the circle $\mathbb{S}^1$. A subgroup $G$ of $\text{Homeo}_{+}(\mathbb{S}^1)$ is tightly transitive if it is topologically transitive and no…

This paper begins the classification of all edge-primitive 3-arc-transitive graphs by classifying all such graphs where the automorphism group is an almost simple group with socle an alternating or sporadic group, and all such graphs where…

We provide the necessary and sufficient condition for a pointwise slant submanifold with respect to two anti-commuting almost Hermitian structures to be also pointwise slant with respect to a family of almost Hermitian structures generated…

The permutation group $S_N$ has a quantum analogue $S_N^+$, which is infinite at $N\geq4$. We review the known facts regarding $S_N^+$, and notably its easiness property, Weingarten calculus, and the isomorphism $S_4^+=SO_3^{-1}$ and its…

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…

Two subgroups H and K are 4-permutable in G if <H,K> = HKHK, and H is strong 4-quasinormal in G if H is 4-permutable with every subgroups K of G. A finite group G is called Sq4T-group if strong 4-quasinormality is transitive relation among…

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

Structures of commuting semigroups of isometries under certain additional assumptions like double commutativity or dual double commutativity are found.

The concept of a k-translatable groupoid is introduced. Those k-translatable quadratical quasigroups induced by the additive group of integers modulo m, where k<40, are listed for m<1200. The fine structure of quadratical quasigroups is…

Quasigroup equational definitions are given.

Some groups of real analytic diffeomorphism act n-transitively for each finite n.

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…