Home A generalization of Sims’ conjecture for finite primitive groups and two point stabilizers in primitive groups
Article Open Access

A generalization of Sims’ conjecture for finite primitive groups and two point stabilizers in primitive groups

  • Pablo Spiga EMAIL logo
Published/Copyright: August 3, 2021

Abstract

In this paper, we propose a refinement of Sims’ conjecture concerning the cardinality of the point stabilizers in finite primitive groups, and we make some progress towards this refinement. In this process, when dealing with primitive groups of diagonal type, we construct a finite primitive group 𝐺 on Ω and two distinct points α , β Ω with G α β G α and G α β 1 , where G α is the stabilizer of 𝛼 in 𝐺 and G α β is the stabilizer of 𝛼 and 𝛽 in 𝐺. In particular, this example gives an answer to a question raised independently by Cameron and by Fomin in the Kourovka Notebook.

1 Introduction

Let 𝐺 be a finite primitive group acting on a set Ω, and let α Ω . The subdegrees of 𝐺 are the lengths of the orbits of the point stabilizer G α := { g G α g = α } on Ω.

Given a subdegree 𝑑 of 𝐺, there is no bound on the degree | Ω | of 𝐺, as a function of 𝑑only. For example, for any prime 𝑝, the dihedral group of order 2 p has a faithful primitive permutation representation of degree 𝑝 with subdegree d = 2 . Despite this, if a finite primitive group 𝐺 has a small subdegree, then the structure of G α is rather restricted; see for instance [20, 22, 25] and the much more recent results in [9, 14]. Following the investigations on the cases d = 3 and d = 4 , Charles Sims [22] was lead to conjecture the following.

Theorem 1.1

Theorem 1.1 (Sims conjecture)

There is a function f : N N such that, if 𝐺 is a finite primitive group with a suborbit of length d > 1 , then the stabilizers have order at most f ( d ) .

This theorem was proved by Cameron, Praeger, Saxl and Seitz [6] using the O’Nan–Scott theorem and the recently (at the time) announced classification of finite simple groups. The CFSGs spurred a new vitality in the old subject of finite permutation groups, and this result was one of the first major applications of the CFSGs; see also [4].

In this paper, we propose a strengthening of Sims’ conjecture that in our opinion captures the structure of point stabilizers of primitive groups to a finer degree. As well as Sims’ conjecture, our conjecture can be phrased in purely group-theoretic terminology, but it is better understood borrowing some terminology from graph theory.

Let 𝐺 be a finite primitive group acting on a set Ω, and let 𝛼 and 𝛽 be two elements of Ω. The orbital graphΓ determined by the ordered pair ( α , β ) , is the directed graph with vertex set Ω and with arc set ( α , β ) G := { ( α g , β g ) g G } . Clearly, 𝐺 is a group of automorphisms of Γ acting primitively on its vertex set and Γ is undirected if and only if the orbital ( α , β ) G is self-paired, that is, ( α , β ) G = ( β , α ) G . We denote by

Γ + ( γ ) := { δ ( γ , δ ) ( α , β ) G } and Γ - ( γ ) := { δ Ω ( δ , γ ) ( α , β ) G }

the out-neighborhood and the in-neighborhood, respectively, of the vertex 𝛾 of Γ. As Ω is finite, it follows that the out-valency and the in-valency of Γ are equal, that is, | Γ + ( γ ) | = | Γ - ( γ ) | for every γ Ω . Moreover, if we denote this valency by 𝑑, then 𝑑 is equal to the cardinality of the suborbit β G α = Γ + ( α ) . In particular, 𝑑 is a subdegree of 𝐺.

Given two vertices 𝛼 and 𝛽 as above, we write G α β := G α G β . Moreover, we denote with

G α + [ 1 ] := δ Γ + ( α ) G α δ and G β - [ 1 ] := δ Γ - ( β ) G δ β ,

the kernel of the action of G α on Γ + ( α ) and of G β on Γ - ( β ) , respectively. Observe that the notation G α + [ 1 ] and G β - [ 1 ] is slightly misleading because it does not show the dependency of this subgroup of 𝐺 from the graph Γ; however, to avoid making the notation too cumbersome, we prefer not to attach the label “Γ” in the notation for G α + [ 1 ] and G β - [ 1 ] .

Furthermore, we denote by G α Γ + ( α ) G α / G α + [ 1 ] and G β Γ - ( β ) G β / G β - [ 1 ] the permutation group induced by G α on Γ + ( α ) and by G β on Γ - ( β ) . The groups G α Γ + ( α ) and G β Γ - ( β ) are (not necessarily isomorphic) permutation groups of degree 𝑑, and they are sometimes referred to as the local groups; see [18, 17] where this terminology is particularly suited.

Using the notation that we have established above, Sims’ conjecture claims that, when d > 1 , the cardinality of G α is bounded above by a function of the valency 𝑑 of the orbital graph Γ. In other words, the order of the vertex stabilizer G α is bounded above by a function of the local group G α Γ + ( α ) . (Actually, the order of the vertex stabilizer is bounded above simply by a function of the degree of the local group.) Broadly speaking, we wish to make a step further, and we wonder whether, besides some families that can be explicitly classified, the order of the arc stabilizer G α β is bounded above by a function of the order of the point stabilizer G α β Γ + ( α ) of the local group G α Γ + ( α ) . More precisely, we propose the following conjecture.

Conjecture 1.2

There exists a function g : N N such that, if 𝐺 is a finite primitive group and 𝛼 and 𝛽 are two distinct points in the domain of 𝐺, then either

  1. G α β has order at most g ( | G α β : G α + [ 1 ] | ) , or

  2. 𝐺 is in a well-described and well-determined list of exceptions.

In this paper, we take a first step towards the proof of Conjecture 1.2 by dealing with primitive groups containing a normal regular subgroup (see Proposition 3.1) and with the primitive groups of simple diagonal type. Here, we report our main result concerning simple diagonal groups. (For undefined terminology, we refer to the second and third paragraphs of Section 4.)

Theorem 1.3

Let 𝐺 be a primitive group on Ω of SD type, let 𝛼 and 𝛽 be two distinct elements from Ω, and consider the action of 𝐺 on the orbital graph determined by ( α , β ) . Then one of the following holds:

  • G α + [ 1 ] = 1 ,

  • | G α + [ 1 ] | = + 1 , G α + [ 1 ] Sym ( + 1 ) and the group G α + [ 1 ] acts regularly on the set { 1 , , + 1 } . Moreover, let

    ( t 0 , t 1 , , t ) N with t 0 = 1 and β = D ( t 0 , t 1 , , t ) .

    The mapping G α + [ 1 ] T defined by σ t 0 σ - 1 is a group homomorphism.

It is quite unfortunate that we cannot omit alternative (ii) in Conjecture 1.2. Examples in this direction are intricate to construct, and we give an example later in this paper; see Example 4.1. In fact, a detailed analysis of the second alternative in Theorem 1.3 yields an example where G α β / G α + [ 1 ] has prime order 𝑝, but G α + [ 1 ] can have order p k for any k 1 .

A positive solution to Conjecture 1.2 can be seen as a strengthening of Sims’ conjecture. This is easy to see, but we postpone the proof to Section 2.1. However, a positive answer to Conjecture 1.2 is a stronger result than Sims’ conjecture: we refer the reader to Example 2.2 to see this and to capture the idea behind our question.

A particularly interesting case for our conjecture is when G α β G α . In this case, G α + [ 1 ] = G α β , that is, the local group G α Γ + ( α ) is regular. In this case, it was asked by Peter Cameron [5] whether G α β = 1 or not, that is, whether or not the whole vertex stabilizer G α acts regularly on the out-neighborhood Γ + ( α ) . This question was also proposed by Fomin in the Kourovka Notebook [16, Question 9.69].[1] Remarkable evidence for a positive answer to the question is given by Konygin [10, 11, 12, 13]; however, to the best of our knowledge, this question is still open. To some extent, Conjecture 1.2 can be seen as a generalization of the Cameron–Fomin question, allowing G α β G α , but relaxing the conclusion for G α β G α . By investigating Conjecture 1.2 for primitive groups of diagonal type, we construct a finite primitive group with G α β G α and G α β 1 , thus giving a negative answer to the Cameron–Fomin question. We present this example in Section 5.

Theorem 1.4

There exists a finite primitive group 𝐺 and two distinct elements 𝛼 and 𝛽 in the domain of 𝐺 such that G α β G α and G α β 1 .

2 Basic results

2.1 Relations between Sims’ conjecture and Conjecture 1.2

Lemma 2.1

Suppose that Conjecture 1.2 holds true. Then any group satisfying part (i) of Conjecture 1.2 satisfies Sims’ conjecture.

Proof

Let 𝑔 be the function arising from a positive solution of Conjecture 1.2. We define a function g : N N by setting

g ( d ) := max { g ( | H δ | ) H transitive on { 1 , , d } , δ { 1 , , d } } .

Now, let 𝐺 be a finite primitive group satisfying part (i) of Conjecture 1.2, let β G α be a suborbit of 𝐺 of cardinality d > 1 , and let Γ be the corresponding orbital graph. Set H := G α + Γ ( α ) , and observe that 𝐻 is a transitive permutation group on Γ + ( α ) of degree 𝑑. The stabilizer of a point in 𝐻 is G α β Γ + ( α ) . Since 𝐺 satisfies Conjecture 1.2 (i), we have

| G α β | g ( | G α β Γ + ( α ) | ) g ( d ) .

Now, | G α | = | G α : G α β | | G α β | = d | G α β | d g ( d ) . Therefore, Sims’ conjecture holds for 𝐺 by taking f ( d ) := d g ( d ) . ∎

Example 2.2

It is interesting to consider finite primitive groups having a suborbit β G α of odd cardinality 𝑑 with G α acting as a dihedral group on β G α . In this case, | G α : G α β | = d and | G α β : G α + [ 1 ] | = 2 . It follows from the main result in [21] (and also from the work of Verret on 𝑝-subregular actions [23, 24]) that | G α β | divides 16. In particular, | G α β | 16 . Observe that this upper bound on | G α β | does not depend on 𝑑.

In particular, in this example, Sims’ conjecture requires bounding | G α | as a function of 𝑑. However, Conjecture 1.2 is more demanding: as | G α β : G α + [ 1 ] | = 2 is a constant, Conjecture 1.2 demands either regarding 𝐺 as an exception or bounding | G α β | from above with an absolute constant. Luckily, in this case, 𝐺 is not an exception because, from [23, 24], | G α β | 16 .

Lemma 2.1 shows that, if Conjecture 1.2 holds true, then it might be possible to prove Sims’ conjecture by checking (possibly with a direct case-by-case inspection) the groups falling in part (ii).

2.2 The O’Nan–Scott theorem and our investigation

The modern key for analyzing a finite primitive permutation group 𝐺 is to study the socle𝑁 of 𝐺, that is, the subgroup generated by the minimal normal subgroups of 𝐺. The socle of an arbitrary finite group is isomorphic to the non-trivial direct product of simple groups; moreover, for finite primitive groups, these simple groups are pairwise isomorphic. The O’Nan–Scott theorem describes in detail the embedding of 𝑁 in 𝐺 and collects some useful information about the action of 𝑁. In [15, Theorem], five types of primitive groups are defined (depending on the group- and action-structure of the socle), namely HA (Affine), AS (Almost Simple), SD (Simple Diagonal), PA (Product Action) and TW (Twisted Wreath), and it is shown that every primitive group belongs to exactly one of these types. We remark that in [19] this subdivision into types is refined, namely the PA type in [15] is partitioned in four parts, which are called HS (Holomorphic Simple), HC (Holomorphic Compound), CD (Compound Diagonal) and PA. For what follows, we find it convenient to use this subdivision into eight types of the finite primitive permutation groups.

In this paper, we investigate Conjecture 1.2 using the O’Nan–Scott theorem.

3 Primitive groups of HA, TW, HS and HC type

Proposition 3.1

Let 𝐺 be a transitive group on Ω containing a normal regular subgroup, let Γ be a connected digraph with vertex set Ω that is left invariant by the action of 𝐺. Then G α + [ 1 ] = 1 , for every α Ω . In particular, Conjecture 1.2 (i) holds true when 𝐺 has O’Nan–Scott type HA , TW , HS and HC and the function 𝑔 can be taken so that g ( n ) := n for every n N .

Proof

Let α Ω . Let 𝑁 be a regular normal subgroup of 𝐺, and let H := G α . Then 𝐺 is the semidirect product of 𝑁 by 𝐻 (that is, G = N G α , N G α = 1 and G = N H ), and the action of 𝐺 on Ω is permutation equivalent to the “affine” action of 𝐺 on 𝑁, where 𝑁 acts on 𝑁 by right multiplication and where 𝐻 acts on 𝑁 by conjugation. In the rest of the proof, we use this identification. In particular, under this equivalence, α Ω corresponds to 1 N . For each β Γ + ( α ) , we let n β be the element of 𝑁 corresponding to 𝛽, that is, α n β = β .

Then G α β = C H ( n β ) and

G α + [ 1 ] = β Γ + ( α ) G α β = β Γ + ( α ) C H ( n β ) = C H ( n β β Γ + ( α ) ) .

Since Γ is connected, we deduce N = n β β Γ + ( α ) . Hence

G α + [ 1 ] = C H ( N ) = 1 .

In other words, G α acts faithfully on Γ + ( α ) .

When 𝐺 has O’Nan–Scott type HA , TW , HS and HC , the proof follows by the fact that 𝐺 contains a normal regular subgroup and by the fact that the non-trivial orbital graphs of 𝐺 are connected. ∎

4 Primitive groups of SD type

We start by recalling the structure of the finite primitive groups of SD type. This will also allow us to set up the notation for this section. A very beautiful account on these groups from a combinatorial and geometric point of view can be found in [1].

Let 1 , and let 𝑇 be a non-abelian simple group. Consider the groups

N = T + 1 and D = { ( t , , t ) N t T } ,

the latter a diagonal subgroup of 𝑁. Set Ω := N / D , the set of right cosets of 𝐷 in 𝑁. Then | Ω | = | T | . Moreover, we may identify each element ω Ω with an element of T as follows: the right coset ω = D ( α 0 , α 1 , , α ) contains a unique element whose first coordinate is 1, namely, the element ( 1 , α 0 - 1 α 1 , , α 0 - 1 α ) . We choose this distinguished coset representative. Now the element 𝜑 of Aut ( T ) acts on N = T + 1 by setting ( α 0 , α 1 , , α ) φ := ( α 0 φ , α 1 φ , , α φ ) for every ( α 0 , α 1 , , α ) N . This group action of Aut ( T ) on 𝑁 can be used to define an action of Aut ( T ) on Ω. Indeed, the element 𝜑 of Aut ( T ) acts on Ω by

D ( 1 , α 1 , , α ) φ = D ( 1 , α 1 φ , , α φ ) .

Note that this action is well-defined because 𝐷 is Aut ( T ) -invariant. Next, the element ( t 0 , , t ) of 𝑁 acts on Ω by

D ( 1 , α 1 , , α ) ( t 0 , , t ) = D ( t 0 , α 1 t 1 , , α t ) = D ( 1 , t 0 - 1 α 1 t 1 , , t 0 - 1 α t ) .

Observe that the action induced by ( t , , t ) N on Ω is the same as the action induced by the inner automorphism corresponding to conjugation by 𝑡. Finally, the element 𝜎 in Sym ( { 0 , , } ) acts on Ω simply by permuting the coordinates. Note that this action is well-defined because 𝐷 is Sym ( + 1 ) -invariant.

The set of all permutations we described generates a group 𝑊 isomorphic to

T + 1 ( Out ( T ) × Sym ( + 1 ) ) .

A subgroup 𝐺 of 𝑊 containing the socle 𝑁 of 𝑊 is primitive if either = 1 or 𝐺 acts primitively by conjugation on the + 1 simple direct factors of 𝑁; see [8, Theorem 4.5A]. The group 𝐺 is said to be primitive of SD type when the second case occurs, that is, N G W and 𝐺 acts primitively by conjugation on the + 1 simple direct factors of 𝑁.

Write

M = { ( t 0 , t 1 , , t ) N t 0 = 1 } .

Clearly, 𝑀 is a normal subgroup of 𝑁 acting regularly on Ω. Since the stabilizer in 𝑊 of the point D ( 1 , , 1 ) is Sym ( + 1 ) × Aut ( T ) , we obtain

W = ( Sym ( + 1 ) × Aut ( T ) ) M .

Moreover, every element x W can be written uniquely as

x = σ φ m with σ Sym ( + 1 ) , φ Aut ( T ) and m M .

Proof of Theorem 1.3

We use the notation that we have established above. Without loss of generality, we may assume that α = D ( 1 , 1 , , 1 ) . Write

β := D ( 1 , t 1 , , t )

for some t 1 , , t T . We set t 0 := 1 , in particular, β = D ( t 0 , t 1 , , t ) . This notation will make the last part of our proof easier to follow.

Let φ G α + [ 1 ] Aut ( T ) . For each t T , we let ι t Aut ( T ) W α denote the permutation on Ω induced by the conjugation via 𝑡. Observe that we have ι t G W α = G α for every t T because T + 1 = N G . As φ G α + [ 1 ] and ι t G α , we deduce that 𝜑 fixes β ι t for every t T . This means that

(4.1) D ( 1 , t 1 t , , t t ) = ( β ι t ) φ = D ( 1 , t 1 t , , t t ) φ = D ( 1 , t 1 t φ , , t t φ )

for every t T . Since β α , there exists i { 1 , , } with t i 1 . Now, (4.1) gives t i t φ = t i t for every t T . Therefore,

φ t T C Aut ( T ) ( t i t ) = C Aut ( T ) ( t i t t T ) = C Aut ( T ) ( T ) = 1 .

This shows that

(4.2) G α + [ 1 ] Aut ( T ) = 1 .

Now, G α + [ 1 ] is a normal subgroup of G α . Since G α acts primitively as a group of permutations on the + 1 simple direct factors of T + 1 , we obtain that either G α + [ 1 ] projects trivially on Sym ( + 1 ) or G α + [ 1 ] projects to a transitive subgroup of Sym ( + 1 ) . If G α + [ 1 ] projects trivially on Sym ( + 1 ) , then G α + [ 1 ] Aut ( T ) and hence G α + [ 1 ] = 1 by (4.2). (In particular, in this case, Conjecture 1.2 part (i) holds true). Therefore, for the rest of this proof, we assume that

G α + [ 1 ] projects to a transitive subgroup of Sym ( + 1 ) .

Observe now that

ι ( T ) = { ι t t T } G α ( because T + 1 = N G ) ,
ι ( T ) G α ( because W α = Aut ( T ) × Sym ( + 1 ) and G α W α ) .
As G α + [ 1 ] Aut ( T ) = 1 , we deduce

G α + [ 1 ] ι ( T ) = 1 .

As G α + [ 1 ] and ι ( T ) are both normal in G α , we deduce that G α + [ 1 ] centralizes ι ( T ) . Since C W α ( ι ( T ) ) = Sym ( + 1 ) , we get G α + [ 1 ] Sym ( + 1 ) . Therefore, G α + [ 1 ] is a transitive subgroup of Sym ( + 1 ) .

Next we show that the group G α + [ 1 ] is a regular subgroup of Sym ( + 1 ) . Let H := N G ( T 0 ) , where T 0 is the first simple direct factor of the socle 𝑁. Now, 𝐻 acts transitively on Ω because N H , and 𝐻 contains the normal regular subgroup M = T 1 × × T . Therefore, by Proposition 3.1 applied to 𝐻, we deduce H α + [ 1 ] = 1 . As | G : H | = | G : N G ( T 0 ) | = + 1 and H α + [ 1 ] = H G α + [ 1 ] , we get | G α + [ 1 ] | + 1 . Since G α + [ 1 ] is a transitive subgroup of Sym ( + 1 ) , G α + [ 1 ] is a regular subgroup of Sym ( + 1 ) and + 1 = | G α + [ 1 ] | .

We need to recall in detail the action of Sym ( + 1 ) on Ω. Given

σ Sym ( + 1 ) and ω = D ( x 0 , x 1 , , x ) Ω ,

we have

(4.3) ω σ = D ( x 0 σ - 1 , x 1 σ - 1 , , x σ - 1 ) .

The element 𝜎 in the right-hand side of (4.3) appears as σ - 1 to guarantee that this is a right action.

Recall β = D ( 1 , t 1 , , t ) = D ( t 0 , t 1 , , t ) . We now define a mapping

w : G α + [ 1 ] T , σ t 0 σ - 1 .

In other words, in the light of (4.3), w ( σ ) is the first coordinate of

( t 0 , t 1 , , t ) σ = ( t 0 σ - 1 , t 1 σ - 1 , , t σ - 1 ) .

Let σ , τ G α + [ 1 ] . Since 𝜏 fixes 𝛽, we have

β = β τ = D ( t 0 τ - 1 , t 1 τ - 1 , , t τ - 1 ) ,

and since σ τ fixes 𝛽, we have also

β = β σ τ = D ( t 0 ( σ τ ) - 1 , t 1 ( σ τ ) - 1 , , t ( σ τ ) - 1 ) .

In other words, the two ( + 1 ) -tuples

( t 0 τ - 1 , t 1 τ - 1 , , t τ - 1 ) and ( t 0 ( σ τ ) - 1 , t 1 ( σ τ ) - 1 , , t ( σ τ ) - 1 )

differ only by the left multiplication by an element of 𝐷. Therefore, there exists t T such that

(4.4) ( t t 0 τ - 1 , t t 1 τ - 1 , , t t τ - 1 ) = ( t 0 ( σ τ ) - 1 , t 1 ( σ τ ) - 1 , , t ( σ τ ) - 1 ) .

By checking the first coordinates in (4.4), we obtain

t t 0 τ - 1 = t 0 ( σ τ ) - 1 .

Moreover, by comparing the coordinate appearing in position 0 τ on the left-hand side and on the right-hand side of (4.4), we deduce that t t ( 0 τ ) τ - 1 = t ( 0 τ ) ( σ τ ) - 1 , that is,

t = t t 0 = t 0 σ - 1 .

Putting these two equations together, we obtain

w ( σ ) w ( τ ) = t 0 σ - 1 t 0 τ - 1 = t t 0 τ - 1 = t 0 ( σ τ ) - 1 = w ( σ τ ) .

This proves that our mapping w : G α + [ 1 ] T is a group homomorphism. ∎

The proof of Proposition 1.3 hints to the fact that in Conjecture 1.2 we do need the alternative (ii). We show that this is indeed the case in the next example.

Example 4.1

Let 𝑝 be a prime number, let k 7 be a positive integer, and let 𝑟 be a primitive prime divisor of p k - 1 , that is, 𝑟 divides p k - 1 and 𝑟 is relatively prime to p i - 1 for each i { 1 , , k - 1 } . As k 7 , the existence of 𝑟 is guaranteed by Zsigmondy’s theorem.

Let H := V C be the affine primitive group of degree p k , where 𝑉 is an elementary abelian 𝑝-group of order p k and where 𝑅 is a cyclic group of order 𝑟. (We use an additive notation for 𝑉.) Let 𝑇 be a non-abelian simple group containing a cyclic subgroup 𝑃 of order 𝑝 and with C T ( P ) = P , and let w : V P be an arbitrary surjective homomorphism.

We denote by T V the set of all functions from 𝑉 to 𝑇. Observe that T V is a group isomorphic to the Cartesian product of | V | = p k copies of 𝑇. We denote the elements of T V as functions f : V T .

We let 𝐺 be the primitive group of diagonal type T V H . Recall that the elements of Ω are right cosets of 𝐷 in T V , where 𝐷 is the diagonal subgroup of T V , that is, D = { f T V f is constant } . Let b = ( t v ) v V T V , where t v = ω ( - v ) for every v V .

Let α := D , let β := D b , and consider the orbital graph determined by ( α , β ) . Let v V . Then

b v ( x ) = b ( x - v ) = w ( - x + v ) = w ( - x ) w ( v ) = w ( v ) w ( - x ) = w ( v ) b ( x ) for all x V .

Thus b v = w ( v ) b and hence β v = D b v = D b = β . This shows V G α β . Since V G α , we deduce that G α + [ 1 ] V . From Proposition 1.3, we have G α + [ 1 ] = V . Thus G α = ( T × R ) G α + [ 1 ] and

G α β = ( G α β ( T × R ) ) G α + [ 1 ] .

Let φ := t h G α β ( T × R ) , with t T and h R . Observe that

(4.5) b t h ( 0 ) = b ( 0 h - 1 ) t = b ( 0 ) t = w ( 0 ) t = 1 t = 1 = w ( 0 ) = b ( 0 ) .

Since D b = β = β t h = D b t h = D b , from (4.5), we get b t h = b .

For every v Ker ( w ) V , we have

w ( - v h - 1 ) t = ( b ( v h - 1 ) ) t = b t h ( v ) = b ( v ) = w ( - v ) = 1 .

Therefore, w ( v h - 1 ) = 1 . This gives Ker ( w ) h - 1 = Ker ( w ) . As

dim Ker ( w ) = k - 1 0

and as 𝑅 is a cyclic group of prime order acting irreducibly on the vector space 𝑉, we deduce that h = 1 . This shows that φ = t T .

Now, b t = b if and only if 𝑡 centralizes all the coordinates of 𝑏. In other words, t C T ( P ) = P . Summing up,

G α β = P × V and G α + [ 1 ] = V .

Thus | G α β : G α + [ 1 ] | = | P | = p and | G α + [ 1 ] | = p k . However, we cannot bound the cardinality of G α + [ 1 ] with 𝑝 only.

5 The example for the Cameron–Fomin question

Our construction is quite elaborate and requires a number of ingredients:

  • let 𝐴 be a non-abelian simple group,

  • let 𝑇 be a non-abelian simple group containing a subgroup 𝑄 with Q = A × A and with C T ( Q ) = 1 ,

  • let 𝐻 be a group containing 𝐴 with 𝐴 maximal in 𝐻, 𝐴 core-free in 𝐻 and, in the faithful permutation action of 𝐻 on the right cosets of 𝐴, there exist two points whose setwise stabilizer is the identity.

We observe that there are groups 𝐴, 𝑇, 𝑄 and 𝐻 satisfying the hypothesis above. For instance, we may take A := Alt ( 5 ) , T := Alt ( 10 ) , Q := Alt ( 5 ) × Alt ( 5 ) T and H := PSL 2 ( p ) where 𝑝 is a prime number with p 61 , p ± 1 ( mod 10 ) . Clearly, 𝐴 and 𝑇 are non-abelian simple and C T ( Q ) = 1 . Moreover, using the hypothesis on 𝑝, 𝐴 is a maximal subgroup in the Aschbacher class 𝒮 of 𝑇; see for instance [2, Table 8.2]. Using the fact that p > 19 , we see from [3, Table 1] that the base size of 𝐻 in the action on the right cosets of 𝐴 is 2. Actually, from the arguments in [3], it follows that, whenever p 61 , there exist two points whose setwise stabilizer is the identity.

Let V := A | H : A | , and let L := V H be a primitive group of TW type with regular socle 𝑉 and with point stabilizer 𝐻. The fact that 𝐿 is primitive in its action on 𝑉 follows from [8, Lemma 4.7A].

As in Example 4.1, we denote by T V the set of all functions from 𝑉 to 𝑇. We let 𝐺 be a primitive group of diagonal type T V L . The elements of Ω are right cosets of 𝐷 in T V , where 𝐷 is the diagonal subgroup of T V , that is, D = { f T V f is constant } .

Relabeling the elements in the domain { 1 , , | H : A | } , we may suppose that 1 , 2 is a base for the action of 𝐻 and the setwise stabilizer of { 1 , 2 } in 𝐻 is the identity. We define the group homomorphism

w : V = A | H : A | Q T , ( a 1 , a 2 , , a | H : A | ) ( a 1 , a 2 ) .

Let b T V with b ( v ) = ω ( v - 1 ) for every v V . Let α := D , let β := D b , and consider the orbital graph determined by ( α , β ) . Let v V . Then

b v ( x ) = b ( x v - 1 ) = w ( ( x v - 1 ) - 1 ) = w ( v x - 1 ) = w ( v ) w ( x - 1 ) = w ( v ) b ( x ) for all x V .

Thus b v = w ( v ) b , and hence β v = D b v = D b = β . This shows V G α β . As V G α , we deduce G α + [ 1 ] V . Now, from Proposition 1.3, we have G α + [ 1 ] = V . Thus G α = T × L = T × H V = T × H G α + [ 1 ] = ( T × H ) G α + [ 1 ] and

(5.1) G α β = ( G α β ( T × H ) ) G α + [ 1 ] .

Let φ := t h G α β ( T × H ) , with t T and h H . Observe that

(5.2) b t h ( 1 ) = b ( 1 h - 1 ) t = b ( 1 ) t = w ( 1 ) t = ( 1 , 1 ) t = ( 1 , 1 ) = w ( 1 ) = b ( 1 ) .

Since D b = β = β t h = D b t h = D b , from (5.2), we get b t h = b .

For every v = ( 1 , 1 , a 3 , , a | H : A | ) Ker ( w ) A | H : A | = V , we have

w ( ( v - 1 ) h - 1 ) t = ( b ( v h - 1 ) ) t = b t h ( v ) = b ( v ) = w ( v - 1 ) = ( 1 , 1 ) .

Therefore, w ( ( v - 1 ) h - 1 ) = ( 1 , 1 ) for every

v = ( 1 , 1 , a 3 , , a | H : A | ) Ker ( w ) A | H : A | = V .

This shows that ℎ fixes { 1 , 2 } setwise, and hence h = 1 , by our assumption on the permutation action of 𝐻 on the right cosets of 𝐴. This shows that φ = t T .

Now, b t = b if and only if, for every v = ( a 1 , a 2 , , a | H : A | ) V , we have b t ( v ) = b ( v ) , that is, ( b ( v ) ) t = b ( v ) . This yields

( a 1 - 1 , a 2 - 1 ) t = ( w ( v - 1 ) ) t = ( b ( v ) ) t = b ( v ) = w ( v - 1 ) = ( a 1 - 1 , a 2 - 1 ) .

As this holds for each ( a 1 , a 2 ) A × A = Q T , we deduce that t C T ( Q ) = 1 . This shows that φ = 1 .

As 𝜑 was an arbitrary element in G α β ( T × H ) , we get G α β ( T × H ) = 1 and hence G α β = G α + [ 1 ] from (5.1). Therefore, G α β G α .

  1. Communicated by: Christopher W. Parker

References

[1] R. A. Bailey, P. J. Cameron, C. E. Praeger and C. Schneider, The geometry of diagonal groups, preprint (2021), https://arxiv.org/abs/2007.10726v2. 10.1090/tran/8507Search in Google Scholar

[2] J. N. Bray, D. F. Holt and C. M. Roney-Dougal, The Maximal Subgroups of the Low Dimensional Classical Groups, London Math. Soc. Lecture Note Ser. 407, Cambridge University, Cambridge, 2013. 10.1017/CBO9781139192576Search in Google Scholar

[3] T. C. Burness, R. M. Guralnick and J. Saxl, Base sizes for 𝒮-actions of finite classical groups, Israel J. Math. 199 (2014), no. 2, 711–756. 10.1007/s11856-013-0059-ySearch in Google Scholar

[4] P. J. Cameron, Finite permutation groups and finite simple groups, Bull. Lond. Math. Soc. 13 (1981), no. 1, 1–22. 10.1112/blms/13.1.1Search in Google Scholar

[5] P. J. Cameron, Suborbits in transitive permutation groups, Combinatorics. Part 3: Combinatorial Group Theory, Mathematisch Centrum, Amsterdam (1974), 98–129. 10.1007/978-94-010-1826-5_20Search in Google Scholar

[6] P. J. Cameron, C. E. Praeger, J. Saxl and G. M. Seitz, On the Sims conjecture and distance transitive graphs, Bull. Lond. Math. Soc. 15 (1983), no. 5, 499–506. 10.1112/blms/15.5.499Search in Google Scholar

[7] J. Chen and H. Y. Huang, On valency problems of Saxl graphs, preprint (2021), https://arxiv.org/abs/2012.13747v2. 10.1515/jgth-2021-0123Search in Google Scholar

[8] J. D. Dixon and B. Mortimer, Permutation Groups, Grad. Texts in Math. 163, Springer, New York, 1996. 10.1007/978-1-4612-0731-3Search in Google Scholar

[9] J. B. Fawcett, M. Giudici, C. H. Li, C. E. Praeger, G. Royle and G. Verret, Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5, J. Combin. Theory Ser. A 157 (2018), 247–266. 10.1016/j.jcta.2018.02.008Search in Google Scholar

[10] A. V. Konygin, On primitive permutation groups with a stabilizer of two points normal in the stabilizer of one of them, Sib. Èlektron. Mat. Izv. 5 (2008), 387–406. Search in Google Scholar

[11] A. V. Konygin, On primitive permutation groups with a stabilizer of two points that is normal in the stabilizer of one of them: Case when the socle is a power of a sporadic simple group, Proc. Steklov Inst. Math. 272 (2011), S65–S73. 10.1134/S0081543811020064Search in Google Scholar

[12] A. V. Konygin, On P. Cameron’s question on primitive permutation groups with a stabilizer of two points that is normal in the stabilizer of one of them, Tr. Inst. Mat. Mekh. 19 (2013), no. 3, 187–198; translation in Proc. Steklov Inst. Math. 285 (2014), 116–127. 10.1134/S0081543814050125Search in Google Scholar

[13] A. V. Konygin, On a question of Cameron on triviality in primitive permutation groups of the stabilizer of two points that is normal in the stabilizer of one of them, Tr. Inst. Mat. Mekh. 21 (2015), no. 3, 175–186. Search in Google Scholar

[14] C. H. Li, Z. P. Lu and D. Marušič, On primitive permutation groups with small suborbits and their orbital graphs, J. Algebra 279 (2004), no. 2, 749–770. 10.1016/j.jalgebra.2004.03.005Search in Google Scholar

[15] M. W. Liebeck, C. E. Praeger and J. Saxl, On the O’Nan–Scott theorem for finite primitive permutation groups, J. Austral. Math. Soc. Ser. A 44 (1988), no. 3, 389–396. 10.1017/S144678870003216XSearch in Google Scholar

[16] V. D. Mazurov and E. I. Khukhro, The Kourovka Notebook. Unsolved Problems in Group Theory, 18th ed., Russian Academy of Sciences Siberian Division, Institute of Mathematics, Novosibirsk, 2014. Search in Google Scholar

[17] P. Potočnik, P. Spiga and G. Verret, On the order of arc-stabilisers in arc-transitive graphs with prescribed local group, Trans. Amer. Math. Soc. 366 (2014), no. 7, 3729–3745. 10.1090/S0002-9947-2014-05992-8Search in Google Scholar

[18] P. Potočnik, P. Spiga and G. Verret, Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs, J. Combin. Theory Ser. B 111 (2015), 148–180. 10.1016/j.jctb.2014.10.002Search in Google Scholar

[19] C. E. Praeger, Finite quasiprimitive graphs, Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 241, Cambridge University, Cambridge (1997), 65–85. 10.1017/CBO9780511662119.005Search in Google Scholar

[20] W. L. Quirin, Primitive permutation groups with small orbitals, Math. Z. 122 (1971), 267–274. 10.1007/BF01109920Search in Google Scholar

[21] A. Q. Sami, Locally dihedral amalgams of odd type, J. Algebra 298 (2006), no. 2, 630–644. 10.1016/j.jalgebra.2005.07.006Search in Google Scholar

[22] C. C. Sims, Graphs and finite permutation groups, Math. Z. 95 (1967), 76–86. 10.1007/BF01117534Search in Google Scholar

[23] G. Verret, On the order of arc-stabilizers in arc-transitive graphs, Bull. Aust. Math. Soc. 80 (2009), no. 3, 498–505. 10.1017/S0004972709000550Search in Google Scholar

[24] G. Verret, On the order of arc-stabilisers in arc-transitive graphs, II, Bull. Aust. Math. Soc. 87 (2013), no. 3, 441–447. 10.1017/S0004972712000470Search in Google Scholar

[25] W. J. Wong, Determination of a class of primitive permutation groups, Math. Z. 99 (1967), 235–246. 10.1007/BF01112454Search in Google Scholar

Received: 2021-02-26
Revised: 2021-07-12
Published Online: 2021-08-03
Published in Print: 2022-01-01

© 2021 Walter de Gruyter GmbH, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 International License.

Downloaded on 26.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2021-0032/html?lang=en
Scroll to top button