DOCSLIB.ORG

Maximal Subgroups of Gln(D)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Maximal Subgroups of Gln(D) Journal of Algebra 259 (2003) 201–225 www.elsevier.com/locate/jalgebra Maximal subgroups of GLn(D) S. Akbari,a,b,∗ R. Ebrahimian,a H. Momenaee Kermani,a and A. Salehi Golsefidy a a Department of Mathematical Sciences, Sharif University of Technology, PO Box 11365-9415, Tehran, Iran b Institute for Studies in Theoretical Physics and Mathematics, Tehran, Iran Received 16 January 2002 Communicated by Jan Saxl Abstract In this paper we study the structure of locally solvable, solvable, locally nilpotent, and nilpotent maximal subgroups of skew linear groups. In [S. Akbari et al., J. Algebra 217 (1999) 422–433] it ∗ has been conjectured that if D is a division ring and M a nilpotent maximal subgroup of D ,thenD is commutative. In connection with this conjecture we show that if F [M]\F contains an algebraic ∗ ∗ element over F ,thenM is an abelian group. Also we show that C ∪ C j is a solvable maximal subgroup of real quaternions and so give a counterexample to Conjecture 3 of [S. Akbari et al., J. Algebra 217 (1999) 422–433], which states that if D is a division ring and M a solvable maximal ∗ subgroup of D ,thenD is commutative. Also we completely determine the structure of division rings with a non-abelian algebraic locally solvable maximal subgroup, which gives a full solution to both cases given in Theorem 8 of [S. Akbari et al., J. Algebra 217 (1999) 422–433]. Ultimately, we extend our results to the general skew linear groups. 2002 Elsevier Science (USA). All rights reserved. Keywords: Division rings; Skew linear groups; Nilpotent; Irreducible; Maximal subgroups Introduction The theory of linear groups over division rings of a fairly general type has been intensively developed in recent decades. The most important results concerning skew linear groups can be found in the interesting book of Shirvani and Wehrfritz (1986) [19]. * Corresponding author. E-mail addresses: [email protected] (S. Akbari), [email protected] (R. Ebrahimian), [email protected] (H. Momenaee Kermani), golsefi[email protected] (A. Salehi Golsefidy). 0021-8693/02/$ – see front matter 2002 Elsevier Science (USA). All rights reserved. PII:S0021-8693(02)00549-5 202 S. Akbari et al. / Journal of Algebra 259 (2003) 201–225 Since typically maximal subgroups are large, their algebraic properties carry over to those of the whole group. In this article we are interested in investigating what happens whenever a maximal subgroup of a general skew linear group admits some specific algebraic property. There are many articles devoted to investigations on skew linear groups include one-dimensional case, i.e., GL1(D), the multiplicative group of a division ring D. Recently the structure of maximal subgroups of division rings have been studied; for instance, see [1–3]. In [3] the following two conjectures have appeared. Conjecture A. Let D be a division ring and M a solvable maximal subgroup of D∗.Then D is commutative. Conjecture B. Let D be a division ring and M a nilpotent maximal subgroup of D∗.Then D is commutative. The special case of Conjecture B makes the following interesting conjecture. Conjecture C. Let D be a division ring and M an abelian maximal subgroup of D∗.Then D is commutative. The present article contains three sections. In Section 1 we establish that C∗ ∪ C∗j(C is the field of complex numbers) is a solvable maximal subgroup of H∗,whereH denotes real quaternions. Thus this gives a counterexample to Conjecture A. Also in Section 1 we show that if M is a nilpotent maximal subgroup of D∗,whereD is a division ring and M\F contains an algebraic element over F ,thenM is an abelian group. In Section 2 we construct a family of maximal subgroups of GLn(D), n>1, and completely classify the reducible maximal subgroups of GLn(D). Moreover, Conjecture C will be extended to skew linear groups and it will be shown that if D is an infinite- dimensional division ring over its center F and GLn(D) is algebraic over F ,thenGLn(D) contains no abelian maximal subgroup. Finally, in Section 3 we generalize our results to general skew linear groups and prove that for a locally finite-dimensional division ring D, if M is a locally nilpotent maximal subgroup of GLn(D),thenM is abelian. Also we show that locally finiteness of a maximal subgroup of GLn(D) implies that GLn(D) is locally finite. Before stating our results, we fix some notations. Throughout, D is a division ring with center F , we shall denote their multiplicative groups by D∗, F ∗, respectively. For any group G and any subset X of G, CG(X),andNG(X) denote respectively the centralizer and the normalizer of X in G. In this article Gr denotes the rth derived subgroup of G.The set of primes which occur as the order of some element of G will be denoted by Π(G). Throughout this paper H<Gmeans that H is a not necessarily proper subgroup of G. By a skew linear group we mean a subgroup of the general skew linear group GLn(D),for n some division ring D.LetG be a subgroup of GLn(D) and set V = D , the space of row n-vectors over D.ThenV is a D-G bimodule in the obvious way. We say that G is an irreducible (respectively reducible, completely reducible) subgroup of GLn(D), whenever V is irreducible (respectively reducible, completely reducible) as a D-G bimodule. Also G is said to be absolutely irreducible if F [G]=Mn(D).ForafieldF , we call a subgroup S. Akbari et al. / Journal of Algebra 259 (2003) 201–225 203 G of GLn(F ) nonmodular if G is torsion and Char F/∈ Π(G). A field extension K/F is said to be radical if for every x ∈ K there exists a natural number n(x) such that xn(x) ∈ F . For a subset X of Mn(D) and a subring R of D, R[X] denotes the subalgebra generated by R and X.AlsoifX is a subset of D,thenR(X) denotes the subdivision ring generated by R and X. We write [V : K]r for the dimension of a right vector space V over a field K. For a given ring R, the group of units of R is denoted by U(R). 1. Maximal subgroups of division rings Division rings have a more complicated structure than fields and much less is known about them. It is easily seen that the multiplicative group of a field does not necessarily have a maximal subgroup. For example, if M is a maximal subgroup of index n of C∗, then for any x ∈ C∗, xn is contained in M, implying M = C∗, since indeed any element of C∗ is an nth power. It seems that the multiplicative group of a noncommutative division ring has maximal subgroup and it was conjectured first in [2]. The structure of a maximal subgroup of a group forces some properties in the group. For example, in [17] there is a theorem which says that if a finite group contains an abelian maximal subgroup, then it should be solvable. It is not true in general case, because there are some examples of nonsolvable groups which have finite abelian maximal subgroups, see [15]. Since GLn(D) is violently non-abelian it is intuitively see that GLn(D) has no abelian maximal subgroup. It is a natural question to ask what can be said about the structure of division rings whose multiplicative subgroups have an abelian maximal group or a solvable maximal subgroup. In what follows we shall give a counterexample to Conjecture A. Let us record the following technical lemma. Lemma 1. H∗ = C∗, j + 1 . Proof. Let G = C∗, j + 1 . We claim that if w,z ∈ C with |z|=|w| and z + j ∈ G then w + j ∈ G.Forz = 0 it is clear, so assume that z = 0. Since |z|=|w|, there exists some element t ∈ C such that wz−1 = t/t¯.Now,(z + j)t = t(w¯ + j) ∈ G.So,w + j ∈ G which proves the claim. Since each element of H is of the form z1 + z2jwherez1,z2 ∈ C, to prove the lemma it suffices to show that for any a ∈ C we have a + j ∈ G.Forr>0, let 1 − r 1 − r 2 u = + 1 − i. 1 + r 1 + r So |u|=1 and using our claim, since 1+j ∈ G,wehaveu+j ∈ G. Thus (1+j)(u+j) ∈ G, which implies that (u − 1)/(u¯ + 1) + j ∈ G. On the other hand, we have √ u − 1 = r. u¯ + 1 Since r>0 was arbitrary, by our claim for all a ∈ C we have a + j ∈ G. ✷ 204 S. Akbari et al. / Journal of Algebra 259 (2003) 201–225 The following theorem asserts a very interesting property of real quaternions, that there is just one subgroup between C∗ and H∗; actually it gives a counterexample to Conjecture 3 of [3]. Theorem 1. Let M be a proper subgroup of H∗ containing C∗ then M = C∗ or M = C∗ ∪ C∗j. Therefore H∗ has a solvable maximal subgroup. ∗ ∗ ∗ ∗ Proof. It suffices to prove that for any z0 ∈ C , H = C ,z0 + j .LetG = C ,z0 + j | |2 = where z0 r0 √> 0. By a similar√ method used in the proof of the previous lemma, since z0 + j ∈ G, both r0 i + jand r0 + jareinG.So, √ √ √ √ r0 + j r0 i + j = (r0i − 1) + r0 − r0 i j ∈ G. Let us put r0i − 1 z1 = √ √ . r0 − r0 i | |2 = 2 + + ∈ | |2 = Then√ z1 √ (r0 1)/(2r0) 1andz1 j G.
Load more

Recommended publications
  • ON the SHELLABILITY of the ORDER COMPLEX of the SUBGROUP LATTICE of a FINITE GROUP 1. Introduction We Will Show That the Order C
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 353, Number 7, Pages 2689{2703 S 0002-9947(01)02730-1 Article electronically published on March 12, 2001 ON THE SHELLABILITY OF THE ORDER COMPLEX OF THE SUBGROUP LATTICE OF A FINITE GROUP JOHN SHARESHIAN Abstract. We show that the order complex of the subgroup lattice of a finite group G is nonpure shellable if and only if G is solvable. A by-product of the proof that nonsolvable groups do not have shellable subgroup lattices is the determination of the homotopy types of the order complexes of the subgroup lattices of many minimal simple groups. 1. Introduction We will show that the order complex of the subgroup lattice of a finite group G is (nonpure) shellable if and only if G is solvable. The proof of nonshellability in the nonsolvable case involves the determination of the homotopy type of the order complexes of the subgroup lattices of many minimal simple groups. We begin with some history and basic definitions. It is assumed that the reader is familiar with some of the rudiments of algebraic topology and finite group theory. No distinction will be made between an abstract simplicial complex ∆ and an arbitrary geometric realization of ∆. Maximal faces of a simplicial complex ∆ will be called facets of ∆. Definition 1.1. A simplicial complex ∆ is shellable if the facets of ∆ can be ordered σ1;::: ,σn so that for all 1 ≤ i<k≤ n thereexistssome1≤ j<kand x 2 σk such that σi \ σk ⊆ σj \ σk = σk nfxg. The list σ1;::: ,σn is called a shelling of ∆.
    [Show full text]
  • ON the INTERSECTION NUMBER of FINITE GROUPS Humberto Bautista Serrano University of Texas at Tyler
    University of Texas at Tyler Scholar Works at UT Tyler Math Theses Math Spring 5-14-2019 ON THE INTERSECTION NUMBER OF FINITE GROUPS Humberto Bautista Serrano University of Texas at Tyler Follow this and additional works at: https://scholarworks.uttyler.edu/math_grad Part of the Algebra Commons, and the Discrete Mathematics and Combinatorics Commons Recommended Citation Bautista Serrano, Humberto, "ON THE INTERSECTION NUMBER OF FINITE GROUPS" (2019). Math Theses. Paper 9. http://hdl.handle.net/10950/1332 This Thesis is brought to you for free and open access by the Math at Scholar Works at UT Tyler. It has been accepted for inclusion in Math Theses by an authorized administrator of Scholar Works at UT Tyler. For more information, please contact [email protected]. ON THE INTERSECTION NUMBER OF FINITE GROUPS by HUMBERTO BAUTISTA SERRANO A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science Department of Mathematics Kassie Archer, Ph.D., Committee Chair College of Arts and Sciences The University of Texas at Tyler April 2019 c Copyright by Humberto Bautista Serrano 2019 All rights reserved Acknowledgments Foremost I would like to express my gratitude to my two excellent advisors, Dr. Kassie Archer at UT Tyler and Dr. Lindsey-Kay Lauderdale at Towson University. This thesis would never have been possible without their support, encouragement, and patience. I will always be thankful to them for introducing me to research in mathematics. I would also like to thank the reviewers, Dr. Scott LaLonde and Dr. David Milan for pointing to several mistakes and omissions and enormously improving the final version of this thesis.
    [Show full text]
  • Classification of Finite Abelian Groups
    Math 317 C1 John Sullivan Spring 2003 Classification of Finite Abelian Groups (Notes based on an article by Navarro in the Amer. Math. Monthly, February 2003.) The fundamental theorem of finite abelian groups expresses any such group as a product of cyclic groups: Theorem. Suppose G is a finite abelian group. Then G is (in a unique way) a direct product of cyclic groups of order pk with p prime. Our first step will be a special case of Cauchy’s Theorem, which we will prove later for arbitrary groups: whenever p |G| then G has an element of order p. Theorem (Cauchy). If G is a finite group, and p |G| is a prime, then G has an element of order p (or, equivalently, a subgroup of order p). ∼ Proof when G is abelian. First note that if |G| is prime, then G = Zp and we are done. In general, we work by induction. If G has no nontrivial proper subgroups, it must be a prime cyclic group, the case we’ve already handled. So we can suppose there is a nontrivial subgroup H smaller than G. Either p |H| or p |G/H|. In the first case, by induction, H has an element of order p which is also order p in G so we’re done. In the second case, if ∼ g + H has order p in G/H then |g + H| |g|, so hgi = Zkp for some k, and then kg ∈ G has order p. Note that we write our abelian groups additively. Definition. Given a prime p, a p-group is a group in which every element has order pk for some k.
    [Show full text]
  • Mathematics 310 Examination 1 Answers 1. (10 Points) Let G Be A
    Mathematics 310 Examination 1 Answers 1. (10 points) Let G be a group, and let x be an element of G. Finish the following definition: The order of x is ... Answer: . the smallest positive integer n so that xn = e. 2. (10 points) State Lagrange’s Theorem. Answer: If G is a finite group, and H is a subgroup of G, then o(H)|o(G). 3. (10 points) Let ( a 0! ) H = : a, b ∈ Z, ab 6= 0 . 0 b Is H a group with the binary operation of matrix multiplication? Be sure to explain your answer fully. 2 0! 1/2 0 ! Answer: This is not a group. The inverse of the matrix is , which is not 0 2 0 1/2 in H. 4. (20 points) Suppose that G1 and G2 are groups, and φ : G1 → G2 is a homomorphism. (a) Recall that we defined φ(G1) = {φ(g1): g1 ∈ G1}. Show that φ(G1) is a subgroup of G2. −1 (b) Suppose that H2 is a subgroup of G2. Recall that we defined φ (H2) = {g1 ∈ G1 : −1 φ(g1) ∈ H2}. Prove that φ (H2) is a subgroup of G1. Answer:(a) Pick x, y ∈ φ(G1). Then we can write x = φ(a) and y = φ(b), with a, b ∈ G1. Because G1 is closed under the group operation, we know that ab ∈ G1. Because φ is a homomorphism, we know that xy = φ(a)φ(b) = φ(ab), and therefore xy ∈ φ(G1). That shows that φ(G1) is closed under the group operation.
    [Show full text]
  • On Some Generation Methods of Finite Simple Groups
    Introduction Preliminaries Special Kind of Generation of Finite Simple Groups The Bibliography On Some Generation Methods of Finite Simple Groups Ayoub B. M. Basheer Department of Mathematical Sciences, North-West University (Mafikeng), P Bag X2046, Mmabatho 2735, South Africa Groups St Andrews 2017 in Birmingham, School of Mathematics, University of Birmingham, United Kingdom 11th of August 2017 Ayoub Basheer, North-West University, South Africa Groups St Andrews 2017 Talk in Birmingham Introduction Preliminaries Special Kind of Generation of Finite Simple Groups The Bibliography Abstract In this talk we consider some methods of generating finite simple groups with the focus on ranks of classes, (p; q; r)-generation and spread (exact) of finite simple groups. We show some examples of results that were established by the author and his supervisor, Professor J. Moori on generations of some finite simple groups. Ayoub Basheer, North-West University, South Africa Groups St Andrews 2017 Talk in Birmingham Introduction Preliminaries Special Kind of Generation of Finite Simple Groups The Bibliography Introduction Generation of finite groups by suitable subsets is of great interest and has many applications to groups and their representations. For example, Di Martino and et al. [39] established a useful connection between generation of groups by conjugate elements and the existence of elements representable by almost cyclic matrices. Their motivation was to study irreducible projective representations of the sporadic simple groups. In view of applications, it is often important to exhibit generating pairs of some special kind, such as generators carrying a geometric meaning, generators of some prescribed order, generators that offer an economical presentation of the group.
    [Show full text]
  • (Hereditarily) Just Infinite Property in Profinite Groups
    Inverse system characterizations of the (hereditarily) just infinite property in profinite groups Colin D. Reid October 6, 2018 Abstract We give criteria on an inverse system of finite groups that ensure the limit is just infinite or hereditarily just infinite. More significantly, these criteria are ‘universal’ in that all (hereditarily) just infinite profinite groups arise as limits of the specified form. This is a corrected and revised version of [8]. 1 Introduction Notation. In this paper, all groups will be profinite groups, all homomorphisms are required to be continuous, and all subgroups are required to be closed; in particular, all references to commutator subgroups are understood to mean the closures of the corresponding abstractly defined subgroups. For an inverse system Λ= {(Gn)n>0, ρn : Gn+1 ։ Gn} of finite groups, we require all the homomorphisms ρn to be surjective. A subscript o will be used to indicate open inclusion, for instance A ≤o B means that A is an open subgroup of B. We use ‘pronilpotent’ and ‘prosoluble’ to mean a group that is the inverse limit of finite nilpotent groups or finite soluble groups respectively, and ‘G-invariant subgroup of H’ to mean a subgroup of H normalized by G. A profinite group G is just infinite if it is infinite, and every nontrivial normal subgroup of G is of finite index; it is hereditarily just infinite if in addition every arXiv:1708.08301v1 [math.GR] 28 Aug 2017 open subgroup of G is just infinite. At first sight the just infinite property is a qualitative one, like that of simplicity: either a group has nontrivial normal subgroups of infinite index, or it does not.
    [Show full text]
  • Orders on Computable Torsion-Free Abelian Groups
    Orders on Computable Torsion-Free Abelian Groups Asher M. Kach (Joint Work with Karen Lange and Reed Solomon) University of Chicago 12th Asian Logic Conference Victoria University of Wellington December 2011 Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 1 / 24 Outline 1 Classical Algebra Background 2 Computing a Basis 3 Computing an Order With A Basis Without A Basis 4 Open Questions Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 2 / 24 Torsion-Free Abelian Groups Remark Disclaimer: Hereout, the word group will always refer to a countable torsion-free abelian group. The words computable group will always refer to a (fixed) computable presentation. Definition A group G = (G : +; 0) is torsion-free if non-zero multiples of non-zero elements are non-zero, i.e., if (8x 2 G)(8n 2 !)[x 6= 0 ^ n 6= 0 =) nx 6= 0] : Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 3 / 24 Rank Theorem A countable abelian group is torsion-free if and only if it is a subgroup ! of Q . Definition The rank of a countable torsion-free abelian group G is the least κ cardinal κ such that G is a subgroup of Q . Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 4 / 24 Example The subgroup H of Q ⊕ Q (viewed as having generators b1 and b2) b1+b2 generated by b1, b2, and 2 b1+b2 So elements of H look like β1b1 + β2b2 + α 2 for β1; β2; α 2 Z.
    [Show full text]
  • Arxiv:1509.08090V1 [Math.GR]
    THE CLASS MN OF GROUPS IN WHICH ALL MAXIMAL SUBGROUPS ARE NORMAL AGLAIA MYROPOLSKA Abstract. We investigate the class MN of groups with the property that all maximal subgroups are normal. The class MN appeared in the framework of the study of potential counter-examples to the Andrews-Curtis conjecture. In this note we give various structural properties of groups in MN and present examples of groups in MN and not in MN . 1. Introduction The class MN was introduced in [Myr13] as the class of groups with the property that all maximal subgroups are normal. The study of MN was motivated by the analysis of potential counter-examples to the Andrews-Curtis conjecture [AC65]. It was shown in [Myr13] that a finitely generated group G in the class MN satisfies the so-called “generalised Andrews- Curtis conjecture” (see [BLM05] for the precise definition) and thus cannot confirm potential counter-examples to the original conjecture. Apart from its relation to the Andrews-Curtis conjecutre, the study of the class MN can be interesting on its own. Observe that if a group G belongs to MN then all maximal subgroups of G are of finite index. The latter group property has been considered in the literature for different classes of groups. For instance in the linear setting, Margulis and Soifer [MS81] showed that all maximal subgroups of a finitely generated linear group G are of finite index if and only if G is virtually solvable. The above property also was considered for branch groups, however the results in this direction are partial and far from being as general as for linear groups.
    [Show full text]
  • Math 602 Assignment 1, Fall 2020 Part A
    Math 602 Assignment 1, Fall 2020 Part A. From Gallier{Shatz: Problems 1, 2, 6, 9. Part B. Definition Suppose a group G operates transitively on the left of a set X. (i) We say that the action (G; X) is imprimitive if there exists a non-trivial partition Q of X which is stable under G. Here \non-trivial" means that Q 6= fXg and Q 6= ffxg : x 2 Xg : Such a partition Q will be called a system of imprimitivity for (G; X). (ii) We say that the action (G; X) is primitive if it is not imprimitive. 1. (a) Suppose that (G; X; Q) is a system of imprimitivity for a transitive left action (G; X), Y 2 Q, y 2 Y . Let H = StabG(Y ), K = StabG(y). Prove the following statements. • K < H < G and H operates transitively on Y . • jXj = jY j · jQj, jQj = [G : H], jY j = [H : K]. (These statements hold even if X is infinite.) (b) Suppose that (G; X) is a transitive left action, y 2 X, K := StabG(y), and H is a subgroup of G such that K < H < G. Let Y := H · y ⊂ X, and let Q := fg · Y j g 2 Gg. (Our general notation scheme is that StabG(Y ) := fg 2 G j g · Y = Y g.) Show that (G; X; Q) is a system of imprimitivity. (c) Suppose that (G; X) is a transitive left action, x 2 X. Show that (G; X) is primitive if and only if Gx is a maximal proper subgroup of G.
    [Show full text]
  • 12.6 Further Topics on Simple Groups 387 12.6 Further Topics on Simple Groups
    12.6 Further Topics on Simple groups 387 12.6 Further Topics on Simple Groups This Web Section has three parts (a), (b) and (c). Part (a) gives a brief descriptions of the 56 (isomorphism classes of) simple groups of order less than 106, part (b) provides a second proof of the simplicity of the linear groups Ln(q), and part (c) discusses an ingenious method for constructing a version of the Steiner system S(5, 6, 12) from which several versions of S(4, 5, 11), the system for M11, can be computed. 12.6(a) Simple Groups of Order less than 106 The table below and the notes on the following five pages lists the basic facts concerning the non-Abelian simple groups of order less than 106. Further details are given in the Atlas (1985), note that some of the most interesting and important groups, for example the Mathieu group M24, have orders in excess of 108 and in many cases considerably more. Simple Order Prime Schur Outer Min Simple Order Prime Schur Outer Min group factor multi. auto. simple or group factor multi. auto. simple or count group group N-group count group group N-group ? A5 60 4 C2 C2 m-s L2(73) 194472 7 C2 C2 m-s ? 2 A6 360 6 C6 C2 N-g L2(79) 246480 8 C2 C2 N-g A7 2520 7 C6 C2 N-g L2(64) 262080 11 hei C6 N-g ? A8 20160 10 C2 C2 - L2(81) 265680 10 C2 C2 × C4 N-g A9 181440 12 C2 C2 - L2(83) 285852 6 C2 C2 m-s ? L2(4) 60 4 C2 C2 m-s L2(89) 352440 8 C2 C2 N-g ? L2(5) 60 4 C2 C2 m-s L2(97) 456288 9 C2 C2 m-s ? L2(7) 168 5 C2 C2 m-s L2(101) 515100 7 C2 C2 N-g ? 2 L2(9) 360 6 C6 C2 N-g L2(103) 546312 7 C2 C2 m-s L2(8) 504 6 C2 C3 m-s
    [Show full text]
  • Computing the Maximal Subgroups of a Permutation Group I
    Computing the maximal subgroups of a permutation group I Bettina Eick and Alexander Hulpke Abstract. We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Or method uses a “hybrid group” approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts. 1991 Mathematics Subject Classification: primary 20B40, 20-04, 20E28; secondary 20B15, 68Q40 1. Introduction Apart from being interesting themselves, the maximal subgroups of a group have many applications in computational group theory: They provide a set of proper sub- groups which can be used for inductive calculations; for example, to determine the character table of a group. Moreover, iterative application can be used to investigate parts of the subgroups lattice without the excessive resource requirements of com- puting the full lattice. Furthermore, algorithms to compute the Galois group of a polynomial proceed by descending from the symmetric group via a chain of iterated maximal subgroups, see [Sta73, Hul99b]. In this paper, we present a new approach towards the computation of the conju- gacy classes of maximal subgroups of a finite permutation group. For this purpose we use a “hybrid group” method. This type of approach to computations in permu- tation groups has been used recently for other purposes such as conjugacy classes [CS97, Hul], normal subgroups [Hul98, CS] or the automorphism group [Hol00]. For finite solvable groups there exists an algorithm to compute the maximal sub- groups using a special pc presentation, see [CLG, Eic97, EW].
    [Show full text]
  • Irreducible Character Restrictions to Maximal Subgroups of Low-Rank Classical Groups of Type B and C
    IRREDUCIBLE CHARACTER RESTRICTIONS TO MAXIMAL SUBGROUPS OF LOW-RANK CLASSICAL GROUPS OF TYPE B AND C KEMPTON ALBEE, MIKE BARNES, AARON PARKER, ERIC ROON, AND A.A. SCHAEFFER FRY Abstract Representations are special functions on groups that give us a way to study abstract groups using matrices, which are often easier to understand. In particular, we are often interested in irreducible representations, which can be thought of as the building blocks of all representations. Much of the information about these representations can then be understood by instead looking at the trace of the matrices, which we call the character of the representation. This paper will address restricting characters to subgroups by shrinking the domain of the original representation to just the subgroup. In particular, we will discuss the problem of determining when such restricted characters remain irreducible for certain low-rank classical groups. 1. Introduction Given a finite group G, a (complex) representation of G is a homomorphism Ψ: G ! GLn(C). By summing the diagonal entries of the images Ψ(g) for g 2 G (that is, taking the trace of the matrices), we obtain the corresponding character, χ = Tr◦Ψ of G. The degree of the representation Ψ or character χ is n = χ(1). It is well-known that any character of G can be written as a sum of so- called irreducible characters of G. In this sense, irreducible characters are of particular importance in representation theory, and we write Irr(G) to denote the set of irreducible characters of G. Given a subgroup H of G, we may view Ψ as a representation of H as well, simply by restricting the domain.
    [Show full text]