Imprimitive permutations in primitive groups

Abstract

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations inside primitive groups goes back to the origins of the theory of permutation groups. However, this is another instance of a situation common in mathematics in which a very natural problem turns out to be extremely difficult. Fortunately, the enormous progresses of the last few decades seem to allow a new momentum on the attack to this problem. In this paper we prove that there are infinite families of primitive groups contained in the union of imprimitive groups and propose a new hierarchy for primitive groups based on that fact. In addition to the previous results and hierarchy, we introduce some algorithms to handle permutations, provide the corresponding GAP implementation, solve some open problems, and propose a large list of open problems. Lisboa,

On the uniform domination number of a finite simple group

“…To complete the proof, we may assume r ∈ H. To handle the case r = 13, we use random search in Magma to show that γ u (G) = 2 (we refer the reader to [18, Section 1.2.4] for further details of the computation). For example, one can check that { (1,2,3,4,5,6,7,8,9,10,11,12,13), (1,2,3,4,5,6,8,9,12,7,11,10,13)} is a TDS for Γ(G). For r ∈ {17, 31} we can use Lemma 2.5 to show that γ u (G) = 2.…”

The invariably generating graph of the alternating and symmetric groups

“…Moreover, n Á 2 mod 4; hence n is not a power of 2 and we do not have affine subgroups. Finally, .1 4 ; n 4/ D .2 2 ; n 4/ 2 fixes at least 4 points; hence it does not belong to PGL 2 .p/ by Lemma 2.11 (2). This concludes the proof in case n Á 2 mod 4.…”

“…Assume then that 4 is a partial sum in c.x/. The unique possibility is c.x/ D .4; : : :/, from which 1 ¤ x 4 fixes an even number of points greater than 3, from which x … PL 2 .q/ by Lemma 2.11 (2).…”

Decomposition theorems for involutive solutions to the Yang-Baxter equation

“…For the first results in this section we use the language of cycle sets. We start with some easy consequences of Theorem 2.4 and the results of [2]. Theorem 3.1.…”