theory finite simple groups de michler gerhard (18 résultats)

Etat : Gut. Zustand: Gut | Seiten: 746 | Sprache: Englisch | Produktart: Bücher.

Etat : Used - Very Good. 2010. Hardcover. Cloth, dj. Slight shelf-wear. Bright, clean internals. Very Good.

Etat : Used - Like New. 2010. 1st Edition. Hardcover. Fine. Dustjacket is fine.

Gebundene Ausgabe, Gr.-8°. Etat : Sehr gut. 1. 746 S. Das Buch ist in sehr gutem, sauberen Zustand. Gebundenes Buch mit Original-Schutzumschlag. Dieser mit leichten Randläsuren. Sonst sauberes und wohlerhaltenes Exemplar. ISBN: 9780521764919 Wir senden umgehend mit beiliegender MwSt.Rechnung. Sprache: Englisch Gewicht in Gramm: 1202.

Etat : Acceptable.

Etat : Good. [ No Hassle 30 Day Returns ][ Ships Daily ] [ Underlining/Highlighting: NONE ] [ Writing: NONE ] [ Edition: Eight ] [ 1 CD/Disk(s) Included ] Publisher: Csmbridge University Press Pub Date: 1/1/2006 Binding: Hardcover Pages: 662 Eight edition.

Hardcover/gebunden. Etat : gut. First Edition. Blauer Pappeinband mit goldgeprägtem Rücken- und Deckeltitel, DVD-Rom in montierter Hinterdeckelhülle und Schutzumschlag. Der Umschlag etwas berieben bzw. mit leichten Kratzern, der Schnitte leicht berieben, der Kopfschnitt auch dezent fleckig, die ersten Seiten randknickig (Seitenrand), einzelne Seiten mit winzigem Knickchen der oberen Ecke oder kleinem Randknick, ansonsten guter Erhaltungszustand. "This book provides the first representation theoretic and algorithmic approach to the theory of abstract finite simple groups. It presents self-contained proofs of classical and new group order formulas, and a new structure theorem for abstract finite simple groups. This, and the famous Brauer-Fowler theorem, provides the theoretical background for the author's algorithm which constructs all finite simple groups G having a 2-central involution z with a given centralizer CG(z)=H. The methods presented are designed for the construction of matrix representations, permutation representations and character tables of large finite groups. The author constructs all the simple satellites of the known simple groups that are not uniquely determined by a given centralizer H. Uniform existence and uniqueness proofs are given for the modern sporadic simple groups discovered by Janko, Higman and Sims, Harada, and Thompson. This latter result proves a long standing open problem in the theory. The experimental results (courtesy of M. Weller) for Chapter 12 are documented in the accompanying DVD." (Verlagstext) Gerhard O. Michler (* 5. Mai 1938 in Braunschweig) ist ein deutscher Mathematiker, der sich mit Darstellungstheorie und Gruppentheorie beschäftigt. Michler wurde 1965 an der Johann Wolfgang Goethe-Universität Frankfurt am Main bei Reinhold Baer promoviert (Radikale und Sockel). Er absolvierte ein Postdoktorat an der Cornell University in Ithaca, New York, USA. Während dieser Zeit wurde seine Tochter Ruth I. Michler geboren. Er habilitierte sich 1968 an der Eberhard Karls Universität Tübingen, wurde 1973 ordentlicher Professor in Gießen und war danach ab Ende der 1970er Jahre Professor an der Universität Duisburg-Essen. Zurzeit ist er Adjunct Professor an der Cornell University (2010). Michler organisierte Tagungen zur Darstellungstheorie am Mathematischen Forschungsinstitut Oberwolfach mit Bertram Huppert und Jonathan L. Alperin. Zu seinen Doktoranden zählen Christine Bessenrodt, Karin Erdmann und Jochen Ziegenbalg. (Wikipedia) In englischer Sprache. IX, (III), 662, (6) pages. Groß 8° (155 x 234mm).

Hardcover/gebunden. Etat : gut. First Edition. Blauer Pappeinband mit goldgeprägtem Rücken- und Deckeltitel, DVD-Rom in montierter Hinterdeckelhülle und Schutzumschlag. Umschlag und Schnitte dezent berieben, ansonsten guter bis sehr guter Erhaltungszustand. "This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the close relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. The author presents a new algorithm by which 25 sporadic simple groups can be constructed (the smallest Mathieu group M11 can be omitted for theoretical reasons), and demonstrates that it is not restricted to sporadic simple groups. He also describes the constructions of various groups and proves their uniqueness whenever possible. The computational existence proofs are documented in the accompanying DVD. The author also states several open problems related to the theorem asserting that there are exactly 26 groups, and R. Brauer's warning that there may be infinitely many. Some of these problems require new experiments with the author's algorithm." (Verlagstext) Gerhard O. Michler (* 5. Mai 1938 in Braunschweig) ist ein deutscher Mathematiker, der sich mit Darstellungstheorie und Gruppentheorie beschäftigt. Michler wurde 1965 an der Johann Wolfgang Goethe-Universität Frankfurt am Main bei Reinhold Baer promoviert (Radikale und Sockel). Er absolvierte ein Postdoktorat an der Cornell University in Ithaca, New York, USA. Während dieser Zeit wurde seine Tochter Ruth I. Michler geboren. Er habilitierte sich 1968 an der Eberhard Karls Universität Tübingen, wurde 1973 ordentlicher Professor in Gießen und war danach ab Ende der 1970er Jahre Professor an der Universität Duisburg-Essen. Zurzeit ist er Adjunct Professor an der Cornell University (2010). Michler organisierte Tagungen zur Darstellungstheorie am Mathematischen Forschungsinstitut Oberwolfach mit Bertram Huppert und Jonathan L. Alperin. Zu seinen Doktoranden zählen Christine Bessenrodt, Karin Erdmann und Jochen Ziegenbalg. (Wikipedia) In englischer Sprache. XI, (I), 733, (7) pages. Groß 8° (157 x 234mm).

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Hardcover. Etat : Like New. Like New. book.

Hardcover. Etat : Brand New. 725 pages. 9.13x6.22x1.89 inches. In Stock.

Hardcover. Etat : new. Hardcover. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the close relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. The author presents a new algorithm by which 25 sporadic simple groups can be constructed (the smallest Mathieu group M11 can be omitted for theoretical reasons), and demonstrates that it is not restricted to sporadic simple groups. He also describes the constructions of various groups and proves their uniqueness whenever possible. The computational existence proofs are documented in the accompanying DVD. The author also states several open problems related to the theorem asserting that there are exactly 26 groups, and R. Brauer's warning that there may be infinitely many. Some of these problems require new experiments with the author's algorithm. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the intimate relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Etat : New. pp. 746.

Hardcover. Etat : Good. Good. book.

Etat : New.

Hardcover. Etat : new. Hardcover. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the close relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. The author presents a new algorithm by which 25 sporadic simple groups can be constructed (the smallest Mathieu group M11 can be omitted for theoretical reasons), and demonstrates that it is not restricted to sporadic simple groups. He also describes the constructions of various groups and proves their uniqueness whenever possible. The computational existence proofs are documented in the accompanying DVD. The author also states several open problems related to the theorem asserting that there are exactly 26 groups, and R. Brauer's warning that there may be infinitely many. Some of these problems require new experiments with the author's algorithm. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the intimate relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Etat : new. Hardcover. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the close relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. The author presents a new algorithm by which 25 sporadic simple groups can be constructed (the smallest Mathieu group M11 can be omitted for theoretical reasons), and demonstrates that it is not restricted to sporadic simple groups. He also describes the constructions of various groups and proves their uniqueness whenever possible. The computational existence proofs are documented in the accompanying DVD. The author also states several open problems related to the theorem asserting that there are exactly 26 groups, and R. Brauer's warning that there may be infinitely many. Some of these problems require new experiments with the author's algorithm. This is a coherent explanation for the existence of the 26 known sporadic simple groups originally arising from many unrelated contexts. The given proofs build on the intimate relations between general group theory, ordinary character theory, modular representation theory and algorithmic algebra described in the first volume. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.