0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Applied mathematics

Buy Now

Applied Finite Group Actions (Hardcover, 2nd rev. and exp. ed. 1999) Loot Price: R4,088
Discovery Miles 40 880
Applied Finite Group Actions (Hardcover, 2nd rev. and exp. ed. 1999): Adalbert Kerber

Applied Finite Group Actions (Hardcover, 2nd rev. and exp. ed. 1999)

Adalbert Kerber

Series: Algorithms and Combinatorics, 19

 (sign in to rate)
Loot Price R4,088 Discovery Miles 40 880 | Repayment Terms: R383 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

The topic of this book is finite group actions and their use in order to approach finite unlabeled structures by defining them as orbits of finite groups of sets. Well-known examples are graph, linear codes, chemical isomers, spin configurations, isomorphism classes of combinatorial designs etc.The second edition is an extended version and puts more emphasis on applications to the constructive theory of finite structures. Recent progress in this field, in particular in design and coding theory, is described.This book will be of great use to researchers and graduate students.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Algorithms and Combinatorics, 19
Release date: August 1999
First published: 1999
Authors: Adalbert Kerber
Dimensions: 235 x 155 x 26mm (L x W x T)
Format: Hardcover
Pages: 454
Edition: 2nd rev. and exp. ed. 1999
ISBN-13: 978-3-540-65941-9
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Science & Mathematics > Mathematics > Algebra > Groups & group theory
Books > Science & Mathematics > Mathematics > Applied mathematics > General
Promotions
LSN: 3-540-65941-2
Barcode: 9783540659419

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