Citation Osaka Journal of Mathematics. 14(1)

Similar documents
5-fold transitive permutation groups in which the stabilizer of five points has a normal Sylow 2-subgroup

1. Group Theory Permutations.

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009)

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

35H MPa Hydraulic Cylinder 3.5 MPa Hydraulic Cylinder 35H-3

ELEMENTARY GROUPS BY HOMER BECHTELL

COMMUTING ELEMENTS IN GALOIS GROUPS OF FUNCTION FIELDS. Fedor Bogomolov and Yuri Tschinkel

ON DOUBLY TRANSITIVE GROUPS OF DEGREE n AND ORDER 2(n-l)n

CONSEQUENCES OF THE SYLOW THEOREMS

A note on cyclic semiregular subgroups of some 2-transitive permutation groups

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018)

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792

NON-NILPOTENT GROUPS WITH THREE CONJUGACY CLASSES OF NON-NORMAL SUBGROUPS. Communicated by Alireza Abdollahi. 1. Introduction

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

MATH 326: RINGS AND MODULES STEFAN GILLE

COUNTING INVOLUTIONS. Michael Aschbacher, Ulrich Meierfrankenfeld, and Bernd Stellmacher

Groups with Few Normalizer Subgroups

Smith theory. Andrew Putman. Abstract

THE KLEIN GROUP AS AN AUTOMORPHISM GROUP WITHOUT FIXED POINT

Elements with Square Roots in Finite Groups

Primitive Matrices with Combinatorial Properties

The coincidence Nielsen number for maps into real projective spaces

ALGEBRA QUALIFYING EXAM, FALL 2017: SOLUTIONS

MATH FINAL EXAM REVIEW HINTS

Recognising nilpotent groups

Finite groups determined by an inequality of the orders of their elements

FULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS. Jian-yi Shi

Classifying Camina groups: A theorem of Dark and Scoppola

Characterization of Families of Rank 3 Permutation Groups by the Subdegrees I

RAPHAËL ROUQUIER. k( )

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

Maximal Class Numbers of CM Number Fields

Title fibring over the circle within a co. Citation Osaka Journal of Mathematics. 42(1)

Section III.15. Factor-Group Computations and Simple Groups

Name (please print) Mathematics Final Examination December 14, 2005 I. (4)

Monoids. Definition: A binary operation on a set M is a function : M M M. Examples:

CHAPTER 4. βs as a semigroup

MA441: Algebraic Structures I. Lecture 18

Lecture 5: Functions : Images, Compositions, Inverses

arxiv: v4 [math.gr] 17 Jun 2015

5 Structure of 2-transitive groups

A NOTE ON PRIMITIVE SUBGROUPS OF FINITE SOLVABLE GROUPS

FINITE GROUPS IN WHICH EVERY ELEMENT IS CONJUGATE TO ITS INVERSE

TEST GROUPS FOR WHITEHEAD GROUPS

Constructive proof of deficiency theorem of (g, f)-factor

Homotopy representation groups and Swan subgroups. Osaka Journal of Mathematics. 24(2) P.253-P.261

w = X ^ = ^ ^, (i*i < ix

Subrings of Finite Commutative Rings

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

Citation Osaka Journal of Mathematics. 44(4)

The Class Equation X = Gx. x X/G

Intorno alla generazione dei gruppi di operazioni

Intermediate semigroups are groups

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

A dual version of Huppert s conjecture on conjugacy class sizes

Groups that are pairwise nilpotent

Section II.8. Normal and Subnormal Series

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS

A characterization of finite soluble groups by laws in two variables

Math 249B. Geometric Bruhat decomposition

Formal Groups. Niki Myrto Mavraki

Math 249B. Nilpotence of connected solvable groups

DICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1

Maximal non-commuting subsets of groups

-ARC-TRANSITIVE GRAPHS Dragan Marusic IMFM, Oddelek za matematiko Univerza v Ljubljani Jadranska 19, 1111 Ljubljana Slovenija

Algebra-I, Fall Solutions to Midterm #1

On dimension of the Schur multiplier of nilpotent Lie algebras

MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS

Citation Osaka Journal of Mathematics. 34(3)

Arc-transitive pentavalent graphs of order 4pq

8 Further theory of function limits and continuity

Irreducible subgroups of algebraic groups

MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11

SOLUTIONS OF AN ALGEBRAIC DIFFERENTIAL EQUATION OF THE FIRST ORDER IN A LIOUVILLIAN EXTENSION OF THE COEFFICIENT FIELD

A characterization of the identity function

G/Ge. FINITE p r-nilpotent GROUPS. II. KEY WORDS AND PHRASES. Frattini subgroup, p -nilpotent group, maximal subgroup,

LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS

Axioms for Set Theory

Notes on ordinals and cardinals

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 24 (2008), ISSN

OTTO H. KEGEL. A remark on maximal subrings. Sonderdrucke aus der Albert-Ludwigs-Universität Freiburg

Moufang lines defined by (generalized) Suzuki groups

Title Problems. Citation 経営と経済, 65(2-3), pp ; Issue Date Right

On p-hyperelliptic Involutions of Riemann Surfaces

On the prime graph of L 2 (q) where q = p α < Introduction

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Written Homework # 5 Solution

The Symmetric Space for SL n (R)

Math 418 Algebraic Geometry Notes

Citation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

Generalized Cayley Digraphs

Solution of Brauer s k(b)-conjecture for π-blocks of π-separable groups

Finite dihedral group algebras and coding theory

Introduction to finite fields

GENERATING SETS KEITH CONRAD

Transcription:

Title 4-fold transitive groups in element of a stabilizer of four which poi a Author(s) Hiramine, Yutaka Citation Osaka Journal of Mathematics 14(1) Issue 1977 Date Text Version publisher URL http://hdlhandlenet/11094/12023 DOI Rights Osaka University

Hiramine, Y Osaka J Math 14 (1977), 151-154 4-FOLD TRANSITIVE GROUPS IN WHICH ANY 2-ELEMENT AND ANY 3-ELEMENT OF A STABILIZER OF FOUR POINTS ARE COMMUTATIVE YUTAKA HIRAMINE (Received November 14, 1975) 1 Introduction The known 4-fold transitive groups in which the stabilizer of four points is nilpotent are *S 4, 5, S 6, A 6, A 7, M n and M 12 In this paper we shall prove the following Theorem Let G be a 4-fold transitive group on Ω If any 2-element and any 3-element of a stabilizer of four points in G are commutative, then G is S 4ί S 5ί 5 6, A*, A 79 M n As a corollary of this theorem, we have that a 4-fold transitive group in which the stabilizer of four points is nilpotent is one of the groups listed in our theorem Our notation is standard (cf Wielandt [9]) For a subgroup X of G and a subset Δ of Ω, X^ is the point-wise stabilizer of Δ in X and if X fixes Δ as a set, the restriction of XΌn Δ will be denoted by X* F(X) is the set of points in Ω= {1, 2,, n} fixed by every element of X 2 Proof of the theorem We proceed by way of contradiction and divide the proof in ten steps From now on we assume that G Ω is a counterexample to our theorem of the least possible degree We set D=G 1234 Let P and R be a Sylow 2-subgrouρ and Sylow 3-subgroup of Z), respectively By [2]-[8], we know the following (1) F(D)= {1,2, 3, 4}, I F(P) \ =4 or 5, R Φ1 and P Ω ~ F^ is not semi-regular (2) \F(P)\=4 Proof From (1), we have only to show that F(P) '=f=5 Suppose IF(P)I -5 We set F(P)= {1, 2, 3, 4, i} and L=<R d d ed> By assumption, P centralizes L and so i^f(l) Then it follows from L<D that i D^

152 Y HlRAMINE Since 2/ΠO: D i \,Zχ\D:D i and \D: D, Φl by (1), we have D:D, >5 and so \F(L)\ >9 By the Witt's theorem, N G (L) F(L > is a 4-fold transitive group Furthermore F(L) \ <n= \ Ω \ since R Φ 1 Hence by our minimal choice of Ω we have N G (L) F^^M n because F(L) >9 Since \F(P)\=S and [P, L]=l, we have \F(L)\ is odd and so N G (L) F^^M U Clearly P F^ is a Sylow 2-subgrouρ of a stabilizer of four points in N G (L) F(L \ so P F^ l by the structure of M π, hence F(L) is a subset of F(P), which is contrary to F(P) =5 Thus we get (2) Now let m be the maximal number of P, with i eω F(P) There exists some/ eω F(P) such that P ; =m We set Pj=Q Then we have (3) Proof By (1), P Ω - F ( L ) is not semi-regular, and so ρφl It is clear that P (4) //" ρ* is a 2-subgroup of G containing Q properly, then we have Proof Suppose that F(Q*) \ > 4 Then there exists an element g e G with (Q*) g <D Since P is a Sylow 2-subgroup of D, (Q*) gd <P holds for some d^d By assumption we can choose an element k in F((Q*) gd ) with k^f(p) Then we have m=\q\<\q*\=\ (Q*) gd \ < \ P k\, which is contrary to the choice ofρ (5) N G (Q) F is 4-fold transitive Proof In the lemma 6 of [1], we put G Ω =N G (Q) F(Q \ p=2 and k=4, then (5) follows immediately from (2) and (4) (6) N G (Qy^S e orm K Proof By (5), N G (Q) F(Q) satisfies the assumption of our theorem Since n is even by (2) and QΦ1, n> \F(Q)\ >6 By the minimal choice of Ω, we have N G (Q) F A 6, S 6 On the other hand, we have N P (Q)>Q by (3), and so it follows from (4) that F(N P (Q)) \ =4 Thus N G (Q) F(Q^A^ which shows (6) (7) Let Shea nontrivial ^-subgroup of D Then F(S)=F(Q) Furthermore pv-f(rϊ j s sem i- re g u l a r and the set F(Q) depends only on D but is independent of the choice of P and Q Proof Since S centralizes ρ, S is contained in N D (Q) By (6), S F =1, that is, F(Q) is a subset of F(S), hence \F(S) \ >6 In the lemma 6 of [1], we put G Q =N G (S) F(S \ p=2 and k= 4, then we get

4-FOLD TRANSITIVE GROUPS 153 ΛΓ G (S) F(S) is 4-fold transitive On the other hand SΦ1, hence n> \F(S)\ >6 By the minimality of Ω, JV G (S) F(S) A G, S 6y A 7, Λf u Suppose F(S)3=F(Q) Then we have F(5) >7 Since P centralizes 5, P acts on F(S)-F(P) and so F(S) is even by (2) Hence N G (S) F^^M 12 Therefore Q F^=l by the structure of M 12 Hence F(S) is a subset of F(Q), a contradiction Thus we conclude F(Q)=F(S) From this, the latter half of (7) immediately follows (8) Let T be a Sylow 2-subgroup of N G (Q) and /?* be an arbitrary Sylow ^-subgroup of D Then [T, R*]=l Proof By (6), there is a 2-element x in N G (Q) such that F(x) Π F(Q) \ =4 and <x g \gtξn G (Q)yw = # c (0)'«> We set <^ ^ejv G (0)> = M, (N G (Q)) F(Q} =K Then N G (Q)=MK Let Γ* be an arbitrary Sylow 2- subgroup of M, then since by (4) Q is a unique Sylow 2-subgrouρ of K, T*Q is a Sylow 2-subgroup of N G (Q) Applying (7), for any u^n G (Q) we get F(Q)=F(R*)=F((R*)«), hence (R*) K Since F(x*) Π ^(Λ*)") I = I F(x<) Π F(0 = 4 for any^eλ/'cίρ), ^ centralizes (Λ*) M Hence M centralizes (Λ*) M, so [Γ*ρ, (Λ*) M ] = 1 Since T*ρ is a Sylow 2-subgroup of N G (Q), there exists an element v^n G (Q) such that T=(T*g) t; Thus we get [Γ, (Λ*)" 1 ']-:! Put u=v~ l Then (8) holds (9) There exists an involution in Q Let t be an involution in Q, then \F(t)\=0(mod3) Proof From (3), the first statement is clear Since F(R)=F(Q)c,F(t), \F(Q)\=6 or 12 and [R, t]=l, we have \F(t)\ = \F(R)\ + \F(t)-F(R)\=0 (mod 3) (10) We have now a contradiction in the following way Let t be an involution in Q For i^ l F(t), we set i' j Then t normalizes CM; There exists an element z in G such that G 12i ~D z By (7), G 12 ; fixes F(Q Z ) as a set We set N=(G l2ij ) F(Q^y then by (4) Q z is a Sylow 2-subgroup of N Again by (7), t normalzes N, hence t normalizes at least one of the Sylow 2-subgroups of N, say Q zm where m is an element of N Now t M ~ IZ ~ I normalizes Q, so t m ~ lz ~ l centralizes R by (8), hence t centralizes R zm Since R z is a subgroup of G 12ij9 R Z <N by (7) Hence R zm <N By (6), Λ^ρ )^"')^ r O M 12 Since the set F(R zm )Γ(F(t) is not empty and F(R tm )nf(t)^f(r itm )= F(Q zm ), we have F(R' m ) Π F(ί) =2 or 4 Since R centralizes t, it follows from (7) that \(Sl-F(R gm ))Γ{F(t)\=0 (mod 3) Hence \F(t)\ = \F(t)nF(R* m )\ + 1 = 1 or 2 (mod 3), contrary to (9) OSAKA KYOIKU UNIVERSITY

154 Y HlRAMINE [1] [2] [3] [4] [5] [6] [7] [8] [9] References D Livingstone and A Wagner: Transitivity of finite permutation groups on unordered sets, Math Z 90 (1965), 393-403 H Nagao: On umltiply transitive groups IV, Osaka J Math 2 (1965), 327-341 H Nagao: T Oyama: T Oyama: 319 T Oyama: T Oyama: T Oyama On multiply transitive groups V, J Algebra 9 (1968), 240-248 On multiply transitive groups VII, Osaka J Math 5 (1968), 319-326 On multiply transitive groups VIII, Osaka J Math 6 (1969), 315- On multiply transitive groups IX, Osaka J Math 7 (1970), 41-56 On multiply transitive groups XI, Osaka J Math 10 (1973), 379-439 On multiply transitive groups XIII, to appear H Wielandt: Finite permutation groups, Academic Press, New York, 1964