Related papers: Permutation groups, partition lattices and block s…

We extend the notion of a {$p$-permutation equivalence} between two $p$-blocks $A$ and $B$ of finite groups $G$ and $H$, from the definition in [Boltje-Xu 2008] to a virtual $p$-permutation bimodule whose components have twisted diagonal…

A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth. In this paper we study three special types of inclusions of innately transitive permutation groups in wreath…

The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…

Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G~S_n on the generalized…

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

Let $\Omega$ be a finite set and $T(\Omega)$ be the full transformation monoid on $\Omega$. The rank of a transformation $t\in T(\Omega)$ is the natural number $|\Omega t|$. Given $A\subseteq T(\Omega)$, denote by $\langle A\rangle$ the…

Let $(\Omega, \leq)$ be a totally ordered set. We prove that if $\Aut(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as $\Aut(\RR,\leq)$ (in the language of lattice-ordered groups) then $\Omega$ and $\RR$ are…

We study the base sizes of finite quasiprimitive permutation groups of twisted wreath type, which are precisely the finite permutation groups with a unique minimal normal subgroup that is also non-abelian, non-simple and regular. Every…

We study the lattice of submonoids of the uniform block permutation monoid containing the symmetric group (which is its group of units). We prove that this lattice is distributive under union and intersection by relating the submonoids…

We present some homological properties of a relation $\beta$ on ordered groupoids that generalises the minimum group congruence for inverse semigroups. When $\beta$ is a transitive relation on an ordered groupoid $G$, the quotient $G /…

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

For a set $\Omega$ an unordered relation on $\Omega$ is a family R of subsets of $\Omega.$ If R is such a relation we let G(R) be the group of all permutations on $\Omega$ that preserves R, that is g belongs to G(R) if and only if x in R…

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…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

We find a necessary condition for the embedding of a central extension of a group $G$ with elementary abelian kernel into the wreath product that corresponds to a permutation action of $G$. The proof uses purely group-theoretic methods.

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…

We consider the wreath product of two symmetric groups as a group of blocks permutations and we study its conjugacy classes. We give a polynomiality property for the structure coefficients of the center of the wreath product of symmetric…

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

If $G$ is a group of permutations of a set $\Omega$ and $\alpha \in \Omega$, then the {\em $\alpha$-suborbits} of $G$ are the orbits of the stabilizer $G_\alpha$ on $\Omega$. The cardinality of an $\alpha$-suborbit is called a {\em…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…