Related papers: Primitive permutation groups containing a cycle

The purpose of this note is to extend the classical Aschbacher--O'Nan--Scott theorem for finite groups to the class of countable linear groups. This relies on the analysis of primitive actions carried out in a previous paper. Unlike the…

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…

We develop a classification of the fixed points and cycles of the Kaprekar transformation in even bases. The most numerous fixed points and cycles are those we denote symmetric and almost-symmetric; the structure of the cycles of these…

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…

In this paper, we describe finite, additively commutative, congruence simple semirings. The main result is that the only such semirings are those of order 2, zero-multiplication rings of prime order, matrix rings over finite fields, those…

A base B for a finite permutation group G acting on a set X is a subset of X with the property that only the identity of G can fix every point of B. We prove that a primitive diagonal group G has a base of size 2 unless the top group of G…

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…

Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection of finite subsets of X, and G is primitive but not…

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. Recently, the authors have completely identified the cyclic Schur…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

Let p be an odd prime number. We show that there exists a finite group of order p^{p+3} whose the mod p cycle map from the mod p Chow ring of its classifying space to its ordinary mod p cohomology is not injective.

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a…

Given a discrete (resp. profinite) group $G$, we define $NCC(G)$ to be the smallest number of cyclic (resp. procyclic) subgroups of $G$ whose conjugates cover $G$. In this paper we determine all residually finite discrete groups with finite…

A spherical system is a combinatorial object, arising in the theory of wonderful varieties, defined in terms of a root system. All spherical systems can be obtained by means of some general combinatorial procedures (such as parabolic…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.