Fr. 369.70

Theory of Infinite Soluble Groups

English · Hardback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

Klappentext The central concept in this monograph is that of a soluable group - a group which is built up from abelian groups by repeatedly forming group extenstions. It covers all the major areas, including finitely generated soluble groups, soluble groups of finite rank, modules over group rings, algorithmic problems, applications of cohomology, and finitely presented groups, while remaining failry strictly within the boundaries of soluable group theory. An up-to-date survey of the area aimed at research students and academic algebraists and group theorists, it is a compendium of information that will be especially useful as a reference work for researchers in the field. Zusammenfassung Covers all the major areas including finitely generated soluble groups, soluble groups of finite rank, modules over group rings, algorithmic problems, applications of cohomology, finitely presented groups, whilst remaining fairly strictly within the boundaries of soluble group theory. Inhaltsverzeichnis Introduction 1: Basic Results on Soluble and Nilpotent Groups 2: Nilpotent Groups 3: Soluble Linear Groups 4: The Theory of Finitely Generated Soluble Groups I 5: Soluble Groups of Finite Rank 6: Finiteness Conditions on Abelian Subgroups 7: The Theory of Finitely Generated Soluble Groups II 8: Centrality in Finitely Generated Soluble Groups 9: Algorithmic Theories of Finitely Generated Soluble Groups 10: Cohomological Methods in Infinite Soluble Group Theory 11: Finitely Presented Soluble Groups 12: Subnormality and Solubility Bibliography Index of Authors Index

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.