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.Read more
- Presents a modern part of combinatorics and combinatorial optimisation from a unifying point of view
- A guide for researchers that is also accessible to graduate students
Reviews & endorsements
'The presentation is very good and the book should be understandable for a non-specialist.' European Mathematical Society
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 1997
- format: Hardback
- isbn: 9780521452069
- length: 432 pages
- dimensions: 234 x 156 x 24 mm
- weight: 0.78kg
- contains: 25 b/w illus. 1 table
- availability: Available
Table of Contents
2. Extremal problems for finite sets
4. The flow-theoretic approach
5. Symmetric chain orders
6. Algebraic methods in Sperner theory
7. Limit theorems
8. Macaulay posets.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×