Sperner Theory: 65 (Encyclopedia of Mathematics and its Applications, Series Number 65) - Hardcover

Engel, Konrad

Hardcover

ISBN 10: 0521452066 ISBN 13: 9780521452069

Publisher: Cambridge University Press, 1997

Synopsis

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.

About this title

Review

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

Book Description

This book presents results on and applications of extremal problems in finite sets and finite posets from a unified point of view. The emphasis is on the powerful methods arising from the fusion of combinatorial techniques with programming, linear algebra, eigenvalue methods, and probability theory.

Edition details

• Publisher: Cambridge University Press
• Publication date: 1997
• Language: English
• ISBN 10: 0521452066
• ISBN 13: 9780521452069
• Binding: Hardcover
• Number of pages: 432