Sperner Theory - Couverture rigide

Engel, Konrad

Couverture rigide

ISBN 10 : 0521452066 ISBN 13 : 9780521452069

Editeur : Cambridge University Press, 1997

Synopsis

Emphasises the powerful methods arising from the fusion of combinatorial techniques with programming, linear algebra, and probability theory.

A propos du livre

Présentation de l'éditeur

The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set? This theorem stimulated the development of a fast growing theory dealing with external problems on finite sets and, more generally, on finite partially ordered sets. This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming, linear algebra, Lie-algebra representations and eigenvalue methods, probability theory, and enumerative combinatorics. Researchers and graduate students in discrete mathematics, optimisation, algebra, probability theory, number theory, and geometry will find many powerful new methods arising from Sperner theory.

Revue de presse

'The presentation is very good and the book should be understandable for a non-specialist.' European Mathematical Society

Détails de l'édition

• Éditeur: Cambridge University Press
• Date d'édition: 1997
• Langue: anglais
• ISBN 10: 0521452066
• ISBN 13: 9780521452069
• Reliure: Relié
• Nombre de pages: 432
• Coordonnées du fabricant: non disponible
• Personne responsable: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; France