Abstract

For a positive integer k, a group G is said to be totally k-closed if for each set Ω\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Omega $$\\end{document} upon which G acts faithfully, G is the largest subgroup of Sym(Ω)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extrm{Sym}(\\Omega )$$\\end{document} that leaves invariant each of the G-orbits in the induced action on Ω×⋯×Ω=Ωk\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Omega \ imes \\cdots \ imes \\Omega =\\Omega ^k$$\\end{document}. Each finite group G is totally |G|-closed, and k(G) denotes the least integer k such that G is totally k-closed. We address the question of determining the closure number k(G) for finite simple groups G. Prior to our work it was known that k(G)=2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(G)=2$$\\end{document} for cyclic groups of prime order and for precisely six of the sporadic simple groups, and that k(G)⩾3\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(G)\\geqslant 3$$\\end{document} for all other finite simple groups. We determine the value for the alternating groups, namely k(An)=n-1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(A_n)=n-1$$\\end{document}. In addition, for all simple groups G, other than alternating groups and classical groups, we show that k(G)⩽7\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(G)\\leqslant 7$$\\end{document}. Finally, if G is a finite simple classical group with natural module of dimension n, we show that k(G)⩽n+2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(G)\\leqslant n+2$$\\end{document} if n⩾14\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$n \\geqslant 14$$\\end{document}, and k(G)⩽⌊n/3+12⌋\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$k(G) \\leqslant \\lfloor n/3 + 12 \\rfloor $$\\end{document} otherwise, with smaller bounds achieved by certain families of groups. This is achieved by determining a uniform upper bound (depending on n and the type of G) on the base sizes of the primitive actions of G, based on known bounds for specific actions. We pose several open problems aimed at completing the determination of the closure numbers for finite simple groups.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call