English
Related papers

Related papers: The quasiprimitive almost elusive groups

200 papers

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Group Theory · Mathematics 2020-09-01 Timothy C. Burness , Adam R. Thomas

We prove that if $G$ is a transitive permutation group of sufficiently large degree $n$, then either $G$ is primitive and Frobenius, or the proportion of derangements in $G$ is larger than $1/(2n^{1/2})$. This is sharp, generalizes…

Group Theory · Mathematics 2024-10-02 Daniele Garzoni

Let $G$ be a finite almost simple group of Lie type acting faithfully and primitively on a set $\Omega$. We prove an analogue of the Boston--Shalev conjecture for conjugacy classes: the proportion of conjugacy classes of $G$ consisting of…

Group Theory · Mathematics 2025-08-04 Sean Eberhard , Daniele Garzoni

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

Group Theory · Mathematics 2014-02-26 Alice Devillers , Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

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…

Group Theory · Mathematics 2019-02-20 Gareth A. Jones

Let $G$ be a finite permutation group on $\Omega.$ An ordered sequence $(\omega_1,\dots, \omega_t)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of its…

Group Theory · Mathematics 2022-12-27 Andrea Lucchini , Dmitry Malinin

Let $G$ be a finite non-regular primitive permutation group on a set $\Omega$ with point stabiliser $G_{\alpha}$. Then $G$ is said to be extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus…

Group Theory · Mathematics 2022-01-17 Timothy C. Burness , Melissa Lee

A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…

Group Theory · Mathematics 2011-12-14 John Bamberg , Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…

Group Theory · Mathematics 2023-10-20 Angsuman Das , Arnab Mandal

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…

Combinatorics · Mathematics 2021-01-19 Cai Heng Li , Shu Jiao Song , Venkata Raghu Tej Pantangi

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

Group Theory · Mathematics 2016-07-14 Michael Giudici , Luke Morgan

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that…

Group Theory · Mathematics 2020-07-17 Michael Larsen , Aner Shalev , Pham Huu Tiep

A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of…

Combinatorics · Mathematics 2014-12-10 Michael Giudici , Luke Morgan , Primož Potočnik , Gabriel Verret

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence $(\omega_1\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of…

Group Theory · Mathematics 2025-01-16 Fabio Mastrogiacomo , Pablo Spiga

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…

Combinatorics · Mathematics 2015-02-05 Luke Morgan , Pablo Spiga , Gabriel Verret

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Group Theory · Mathematics 2018-06-05 Luke Morgan , Cheryl E. Praeger , Kyle Rosa

We examine the subgroup $D(G)$ of a transitive permutation group $G$ which is generated by the derangements in $G$. Our main results bound the index of this subgroup: we conjecture that, if $G$ has degree $n$ and is not a Frobenius group,…

Group Theory · Mathematics 2020-04-07 R. A. Bailey , Peter J. Cameron , Michael Giudici , Gordon F. Royle

A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…

Group Theory · Mathematics 2014-08-08 John R. Britnell , Neil Saunders , Tony Skyner

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

Group Theory · Mathematics 2015-09-01 Binzhou Xia

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only…

Group Theory · Mathematics 2019-08-28 Mariusz Grech , Andrzej Kisielewicz