Related papers: Rank three innately transitive permutation groups …
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
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 give examples of finite quantum permutation groups which arise from the twisting construction or as bicrossed products associated to exact factorizations in finite groups. We also give examples of finite quantum groups which are not…
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…
Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably…
On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…
In this paper, we construct a family of reductive groups, including all reductive groups up to a given rank. We also construct a similar versal family of quasi-split reductive groups. This result generalizes a former result of N.Avni and…
A complete classification is given of finite groups whose elements are partitioned into three orbits by the automorphism groups, solving the long-standing classification problem initiated by G. Higman in 1963. As a consequence, a…
We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
Let $G$ be a finite permutation group of degree $n$ and let ${\rm ifix}(G)$ be the involution fixity of $G$, which is the maximum number of fixed points of an involution. In this paper we study the involution fixity of almost simple…
We discuss the notion of essential dimension of a finite group and explain its relation with birational algebraic geometry. We show how this leads to a (partial) classification of simple finite groups of essential dimension less than or…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…
Given an explicit presentation of a reflection group of rank two (or any rank two group for that matter), we give a simple procedure for calculating all its systems of imprimitivity, when viewed as a matrix group over the quaternions. This…
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 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$…
In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…
Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…
While every group is isomorphic to a transitive group of permutations, the analogous property fails for inverse semigroups: not all inverse semigroups are isomorphic to transitive inverse semigroups of one-to-one partial transformations of…