APPLIED FINITE GROUP ACTIONS - ALGORITHMS AND COMBINATORICS

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.