Related papers: Finite permutation groups with quasi-semiregular e…

Let $T(X)$ be the full transformation semigroup on a set $X$, and let $L(V)$ be the semigroup under composition of all linear transformations on a vector space $V$ over a field. For a subset $Y$ of $X$ and a subspace $W$ of $V$, consider…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

By a classical theorem of Jordan, every faithful transitive action of a nontrivial finite group has a derangement (an element with no fixed points). The existence of derangements with additional properties has attracted much attention,…

Given a finite nonabelian semisimple group $G$, we describe those groups that have the same holomorph as $G$, that is, those regular subgroups $N\simeq G$ of $S(G)$, the group of permutations on the set $G$, such that…

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

In this paper, we classify finite quasiprimitive permutation groups with a metacyclic transitive subgroup, solving a problem initiated by Wielandt in 1949. It also involves the classification of factorizations of almost simple groups with a…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…

We determine subnormalisers of semisimple elements of prime power order in finite quasi-simple groups of Lie type. For this, we determine the maximal overgroups of normalisers of Sylow tori. This is motivated by the recent character…

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…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

This paper classifies quasiprimitive permutation groups with a transitive subgroup which is isomorphic to $\A_n$ for some $n\geqslant5$.

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…

We characterize affine semigroups having one Betti element and we compute some relevant non-unique factorization invariants for these semigroups. As an example, we particularize our description to numerical semigroups.