Representations of Solvable Groups

Representations of Solvable Groups

EnglishPaperback / softbackPrint on demand
Manz Olaf
Cambridge University Press
EAN: 9780521397391
Print on demand
Delivery on Wednesday, 19. of August 2026
CZK 1,917
Common price CZK 2,130
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

Representation theory plays an important role in algebra, and in this book Manz and Wolf concentrate on that part of the theory which relates to solvable groups. The authors begin by studying modules over finite fields, which arise naturally as chief factors of solvable groups. The information obtained can then be applied to infinite modules, and in particular to character theory (ordinary and Brauer) of solvable groups. The authors include proofs of Brauer's height zero conjecture and the Alperin-McKay conjecture for solvable groups. Gluck's permutation lemma and Huppert's classification of solvable two-transive permutation groups, which are essentially results about finite modules of finite groups, play important roles in the applications and a new proof is given of the latter. Researchers into group theory, representation theory, or both, will find that this book has much to offer.
EAN 9780521397391
ISBN 0521397391
Binding Paperback / softback
Publisher Cambridge University Press
Publication date September 16, 1993
Pages 316
Language English
Dimensions 228 x 151 x 18
Country United Kingdom
Authors Manz Olaf; Wolf Thomas R.
Illustrations Worked examples or Exercises
Series London Mathematical Society Lecture Note Series
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.