Yahoo奇摩 網頁搜尋

搜尋結果

  1. Contents Preface xi Chapter 1. Introduction 1 Chapter 2. Preliminaries 9 2.1. Notation 9 2.2. Subgroups 13 2.3. Automorphisms and Lie algebras 15 2.4. Frobenius morphisms and the Lang-Steinberg theorem 19 2.5. Nilpotent and unipotent elements 20 2.6.

  2. \master" | 2011/10/18 | 17:10 | page ii | #2 c 2009 by the Mathematical Association of America, Inc. Library of Congress Catalog Card Number 2009923532 Print edition ISBN 978-0-88385-757-1 Electronic edition ISBN 978-1-61444-102-1

  3. Computational group theory (CGT) is one of the oldest and most developed branches of com- putational algebra. Although most general-pur- pose symbolic algebra programs can handle groups to a certain extent, there are two systems which are particularly well suited for computa- tions with groups: GAPand Magma.

  4. 2002年5月17日 · Lang’s theorem follows from connectivity ofGonce we know that has the same dimension asG, because thenG= ,soGis also the orbit through 1. By [3, 4.1], we need to show thatg1xF(g)=xhas only nitely many solutionsg2G. Rewrite this asf(g)=g,wheref(g):=xF(g)x1.Letmbe a positive integer such thatFm. is a standard Frobenius endomorphism withx=Fm(x).

  5. simple groups are 5, the alternating group on five symbols, with 60 elements, and PSL(2,7), a member of one of the families of groups of Lie type (see the next section), with 168 elements. In addition to the simple groups belonging to infinite families, there are also

    • 1MB
    • 6
  6. The polynomial invariants of nite groups have been studied for more than a century now and continue to nd new applications and generate interesting problems. In this article we will survey some of the recent devel- opments coming primarily from algebraic topology and the rediscovery of old open problems.

  7. 2003年12月16日 · BOOK REVIEWS 255 then there exists a 4-generator group whose subgroup growth has type ng(n).This result shows that the subgroup growth spectrum is essentially complete. That is, for any reasonably nice non-decreasing unbounded function g: N!(0;1)such that g(n)=o(n) there exists a nitely generated residually nite group whose ...

  1. 其他人也搜尋了