Applied Finite Group Actions

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 graphs, linear codes, chemical isomers, spin configurations, isomorphism classes of combinatorial designs etc. Th...

Full description

Bibliographic Details
Main Author: Kerber, Adalbert
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1999, 1999
Edition:2nd ed. 1999
Series:Algorithms and Combinatorics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02094nmm a2200349 u 4500
001 EB000690231
003 EBX01000000000000000543313
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783662111673 
100 1 |a Kerber, Adalbert 
245 0 0 |a Applied Finite Group Actions  |h Elektronische Ressource  |c by Adalbert Kerber 
250 |a 2nd ed. 1999 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1999, 1999 
300 |a XXV, 454 p  |b online resource 
505 0 |a 0. Labeled Structures -- 1. Unlabeled Structures -- 2. Enumeration of Unlabeled Structures -- 3. Enumeration by Weight -- 4. Enumeration by Stabilizer Class -- 5. Poset and Semigroup Actions -- 6. Representations -- 7. Further Applications -- 8. Permutations -- 9. Construction and Generation -- 10. Tables -- 11. Appendix -- 12. Comments and References -- References 
653 |a Chemometrics 
653 |a Linear Algebra 
653 |a Mathematical Applications in Chemistry 
653 |a Mathematical physics 
653 |a Discrete Mathematics 
653 |a Algebras, Linear 
653 |a Discrete mathematics 
653 |a Theoretical, Mathematical and Computational Physics 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Algorithms and Combinatorics 
028 5 0 |a 10.1007/978-3-662-11167-3 
856 4 0 |u https://doi.org/10.1007/978-3-662-11167-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 
520 |a 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 graphs, linear codes, chemical isomers, spin configurations, isomorphism classes of combinatorial designs etc. This 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