Question

Assume is a non-abelian group of odd order. Let and be the Cayley graph.

We have known that is vertex-transitive and edge-transitive on . The question is, is arc-transitive?

The key point is to understand . Let be a group satisfying . Then we will analyse .

Case 1. is non-solvable

Quotient group of solvable radical in

Let be the solvable radical of , i.e. the largest solvable normal subgroup. Then is non-solvable. Since , is half-transitive (i.e. -orbits have the same length). Let be an orbit of on . Then is a block system for on .

Let be the kernel of on . is transitive on and with . Since is a -group, is solvable by Burnside’s theorem. Then is solvable. By solvable radical, .

Burnside's Theorem

Burnside’s Theorem

Let and be prime numbers, and let and be non-negative integers with . If is a group of order , then is not simple.

Link to original

Let be the quotient graph. Since is egde-transitive and , the valency of divides . Thus the valency of is 1, 2 or 4.

  • If valency is 1, then is 2. It is contradictory to and is odd.
  • if valency is 2, then is a circle whose automorphism group is dihedral. Then is solvable, which is also impossible.

Therefore, the valency of is 4.

Let . Then , where is metacyclic and is a -group.

Centralizer of the minimal normal subgroup of is trivial

Let . Since is the quotient group of solvable radical, is non-abelian. Then , where is non-abelian simple and .

Note that . Otherwise assume that . Since is non-abelian simple, there exists a prime dividing by Burnside’s theorem. Then and as is -group, which is impossible as is not a subgroup of a metacyclic group.

Now assume , then where are isomorphic simple groups. Let . Then and by center-free. Thus .

If , consider . If is transitive on , then and . Thus is a -group, which is contradictory to . Thus is intransitive on and is a quotient graph. The argument is similar as above: consider the valency of :

  • If valency is 1, , which is impossible as is odd.
  • If valency is 2, is a circle and so is a subgroup of dihedral group. It derives a contradiction by is non-solvable.
  • If valency is 4, and has the same valency and so acting on is semiregular (otherwise valency of is strictly less than 4). Hence . However, it is impossible since is odd and is even ( is nonsolvable yields is even).

Feit-Thompson Theorem

Every finite simple group (that is not cyclic) has even group order, and the group order of every finite simple non-commutative group is doubly even, i.e., divisible by 4.

Therefore, . By N/C lemma, .

is almost simple

Now we have known that

Let . Note that , and is odd. Thus

or

Since and is odd, and so is transitive on .

Consider the quotient graph . Since is non-solvable and is odd, acting on has non-trivial stabilizer. Thus valency of is 2 and is dihedral, which is impossible.

Therefore, and is almost simple.

Explicit structure of (问题很多)

By Kazarin’s theorem, … see notes of 23/4/13.

Some cases never happen

Case 1. Suppose and where . If , has a primitive prime divisor , where primitive prime divisor is defined in the following theorem.

Zsigmondy’s theorem. Let such that and . There exists a prime divisor of that does not divide for all , which is called primitive prime divisor, except in the following cases:

  • ,
  • and is a power of .

Note that : For any primitive prime divisor of with , if divides none of , there exist such that . Then is divided by , which is contradictory with dividing . So . However, is a primitive prime divisor of yields is divided by . It is impossible as is a -group.

Therefore, for some prime and so , . Then or and or respectively. 这是什么结论吗?以PSL为socle的群就这些?对应的Xalpha又为什么是这两种? Let where or .

Define . There is s.t. , then .

Suppose is cyclic with . Then is also a cyclic subgroup of a dihedral group. Note that cyclic subgroup with order greater than is unique. Hence for some and so . Thus or . (并不知道为什么C的normalizer一定长这样。但g怎么会在中呢?我觉得这本身就已经矛盾了:因为g没有固定alpha) It is contradictory to . 既不知道为什么Xalpha和g生成X,也不知道生成了能有什么矛盾--如果是我上面说的那样,直接从那得到矛盾就可以了啊。 So or .

Since , we have

Hence . By prime satisfying , . Therefore, or and or .

Case 2. Assume and . and 2-transitive yields the graph is , 2trans和K7是怎么来的都不知道。我猜这里是要对一个子图说明valency大于4来出矛盾。 which is impossible as is of valency .

Case 3. Assume and , where and is generated by the Frobenius automorphism.

Let be the kernel of acting on . Then . … 应该能推出且要推出是某个阶不是2的幂的群?

Fact. has unique minimal subgroup .

Since , is not trivial. And yields by fact. Then is a -group. Contradiction.

Some cases can be constructed

Case 1. Let . Then and . If there exists such that , then . 这怎么啪的就出来了,怎么算的(

Fact. is a maximal subgroup.

By the fact, is connected of valency . Let . Since , is transitive on . yields acting on the coset graph is regular and so it is a Cayley graph.

Case 2. Let . Then . Let , where . (why we take g in centralizer?) By Magma, . (so what? does this mean the case of PSL(2,7) is impossible?)

Let . Then . (Why , instead of or ?前面提过这个问题了。) Let , (similarly, why g is taken from normalizer) where . Since is a maximal group of , . Using the same argument above, is a Cayley graph.

Explicit structure of

Now we have known that . (i think up to now we only know L is one of groups in the list? 所以Xbar会随之确定?) And where is metacyclic and is the maximal solvable subgroup of .

Let be the maximal characteristic group of . Then and is characteristically simple, which is or by the following lemma.

Def. If is a group, then is a characteristic subgroup of (written ) if every automorphism of maps to itself.

Prop. If and then .

Def. A group is said to be characteristically simple if it has no proper nontrivial characteristic subgroups.

Lemma. A group is characteristically simple iff is a direct product of isotropic simple groups.

Suppose . Then 放弃,最后是要证明出,但是我不仅不知道那几个等号是怎么搞出来的,也不知道这个等式怎么就说明了。坐等笔记。

… Thus, .