Cantitate/Preț
Produs

Applied Finite Group Actions: Algorithms and Combinatorics, cartea 19

Autor Adalbert Kerber
en Limba Engleză Paperback – 15 dec 2010
Also the present second edition of this book is an introduction to the theory of clas­ sification, enumeration, construction and generation of finite unlabeled structures in mathematics and sciences. Since the publication of the first edition in 1991 the constructive theory of un­ labeled finite structures has made remarkable progress. For example, the first- designs with moderate parameters were constructed, in Bayreuth, by the end of 1994 ([9]). The crucial steps were - the prescription of a suitable group of automorphisms, i. e. a stabilizer, and the corresponding use of Kramer-Mesner matrices, together with - an implementation of an improved version of the LLL-algorithm that allowed to find 0-1-solutions of a system of linear equations with the Kramer-Mesner matrix as its matrix of coefficients. of matrices of the The Kramer-Mesner matrices can be considered as submatrices form A" (see the chapter on group actions on posets, semigroups and lattices). They are associated with the action of the prescribed group G which is a permutation group on a set X of points induced on the power set of X. Hence the discovery of the first 7-designs with small parameters is due to an application of finite group actions. This method used by A. Betten, R. Laue, A. Wassermann and the present author is described in a section that was added to the manuscript of the first edi­ tion.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 95335 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 15 dec 2010 95335 lei  6-8 săpt.
Hardback (1) 95967 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 18 aug 1999 95967 lei  6-8 săpt.

Din seria Algorithms and Combinatorics

Preț: 95335 lei

Preț vechi: 116261 lei
-18% Nou

Puncte Express: 1430

Preț estimativ în valută:
18244 19071$ 15417£

Carte tipărită la comandă

Livrare economică 07-21 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642085222
ISBN-10: 3642085229
Pagini: 484
Ilustrații: XXV, 454 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:Softcover reprint of hardcover 2nd ed. 1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

This book, written by one of the top-experts in the fields of combinatorics and representation theory, distinguishes itself by its applications-oriented point of view from the existing literature in this field of mathematics Includes supplementary material: sn.pub/extras