0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Permutation Groups (Hardcover, 1996 ed.) Loot Price: R2,929
Discovery Miles 29 290
Permutation Groups (Hardcover, 1996 ed.): John D. Dixon, Brian Mortimer

Permutation Groups (Hardcover, 1996 ed.)

John D. Dixon, Brian Mortimer

Series: Graduate Texts in Mathematics, 163

 (sign in to rate)
Loot Price R2,929 Discovery Miles 29 290 | Repayment Terms: R274 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Following the basic ideas, standard constructions and important examples in the theory of permutation groups, the book goes on to develop the combinatorial and group theoretic structure of primitive groups leading to the proof of the pivotal ONan-Scott Theorem which links finite primitive groups with finite simple groups. Special topics covered include the Mathieu groups, multiply transitive groups, and recent work on the subgroups of the infinite symmetric groups. With its many exercises and detailed references to the current literature, this text can serve as an introduction to permutation groups in a course at the graduate or advanced undergraduate level, as well as for self-study.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Graduate Texts in Mathematics, 163
Release date: April 1996
First published: 1996
Authors: John D. Dixon • Brian Mortimer
Dimensions: 235 x 155 x 28mm (L x W x T)
Format: Hardcover
Pages: 348
Edition: 1996 ed.
ISBN-13: 978-0-387-94599-6
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Science & Mathematics > Mathematics > Algebra > Groups & group theory
LSN: 0-387-94599-7
Barcode: 9780387945996

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners